./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.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 be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:51:02,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:51:02,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:51:02,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:51:02,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:51:02,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:51:02,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:51:02,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:51:02,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:51:02,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:51:02,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:51:02,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:51:02,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:51:02,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:51:02,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:51:02,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:51:02,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:51:02,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:51:02,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:51:02,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:51:02,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:51:02,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:51:02,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:51:02,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:51:02,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:51:02,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:51:02,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:51:02,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:51:02,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:51:02,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:51:02,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:51:02,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:51:02,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:51:02,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:51:02,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:51:02,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:51:02,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:51:02,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:51:02,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:51:02,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:51:02,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:51:02,175 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:51:02,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:51:02,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:51:02,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:51:02,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:51:02,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:51:02,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:51:02,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:51:02,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:51:02,206 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:51:02,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:51:02,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:51:02,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:51:02,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:51:02,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:51:02,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:51:02,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:51:02,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:51:02,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:51:02,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:51:02,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:51:02,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:51:02,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:51:02,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:51:02,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:51:02,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:51:02,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:51:02,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:51:02,211 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:51:02,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:51:02,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:51:02,212 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 -> be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 [2022-02-20 21:51:02,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:51:02,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:51:02,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:51:02,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:51:02,443 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:51:02,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2022-02-20 21:51:02,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4dd1a2b3/da8e75efada04827a9a687f9324e3a8a/FLAG0146fd83a [2022-02-20 21:51:03,203 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:51:03,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2022-02-20 21:51:03,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4dd1a2b3/da8e75efada04827a9a687f9324e3a8a/FLAG0146fd83a [2022-02-20 21:51:03,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4dd1a2b3/da8e75efada04827a9a687f9324e3a8a [2022-02-20 21:51:03,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:51:03,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:51:03,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:51:03,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:51:03,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:51:03,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:51:03" (1/1) ... [2022-02-20 21:51:03,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3fc56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:03, skipping insertion in model container [2022-02-20 21:51:03,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:51:03" (1/1) ... [2022-02-20 21:51:03,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:51:03,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:51:04,041 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2022-02-20 21:51:04,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:51:04,434 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:51:04,551 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2022-02-20 21:51:04,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:51:04,772 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:51:04,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04 WrapperNode [2022-02-20 21:51:04,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:51:04,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:51:04,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:51:04,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:51:04,782 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:51:04" (1/1) ... [2022-02-20 21:51:04,852 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:51:04" (1/1) ... [2022-02-20 21:51:04,964 INFO L137 Inliner]: procedures = 169, calls = 721, calls flagged for inlining = 77, calls inlined = 77, statements flattened = 2029 [2022-02-20 21:51:04,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:51:04,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:51:04,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:51:04,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:51:04,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:04,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:51:05,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:51:05,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:51:05,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:51:05,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (1/1) ... [2022-02-20 21:51:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:51:05,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:51:05,181 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:51:05,203 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:51:05,218 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-02-20 21:51:05,219 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-02-20 21:51:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:51:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_18 [2022-02-20 21:51:05,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_18 [2022-02-20 21:51:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2022-02-20 21:51:05,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2022-02-20 21:51:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2022-02-20 21:51:05,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2022-02-20 21:51:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2022-02-20 21:51:05,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2022-02-20 21:51:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:51:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:51:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:51:05,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:51:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:51:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-02-20 21:51:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-02-20 21:51:05,222 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_bulk_callback [2022-02-20 21:51:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_bulk_callback [2022-02-20 21:51:05,222 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2022-02-20 21:51:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2022-02-20 21:51:05,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-02-20 21:51:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-02-20 21:51:05,223 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-02-20 21:51:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-02-20 21:51:05,223 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-02-20 21:51:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-02-20 21:51:05,223 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 21:51:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 21:51:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:51:05,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:51:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-02-20 21:51:05,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-02-20 21:51:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:51:05,224 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:51:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-02-20 21:51:05,225 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-02-20 21:51:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:51:05,225 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:51:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-02-20 21:51:05,225 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-02-20 21:51:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:51:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:51:05,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:51:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:51:05,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:51:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:51:05,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:51:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 21:51:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 21:51:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-02-20 21:51:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-02-20 21:51:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:51:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-02-20 21:51:05,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-02-20 21:51:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-02-20 21:51:05,229 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-02-20 21:51:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:51:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-02-20 21:51:05,230 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-02-20 21:51:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 21:51:05,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 21:51:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:51:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:51:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-02-20 21:51:05,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-02-20 21:51:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:51:05,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:51:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-02-20 21:51:05,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-02-20 21:51:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-02-20 21:51:05,232 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-02-20 21:51:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:51:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_disconnect [2022-02-20 21:51:05,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_disconnect [2022-02-20 21:51:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-02-20 21:51:05,233 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-02-20 21:51:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-02-20 21:51:05,233 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-02-20 21:51:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_interrupt_callback [2022-02-20 21:51:05,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_interrupt_callback [2022-02-20 21:51:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-02-20 21:51:05,234 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-02-20 21:51:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:51:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-02-20 21:51:05,234 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-02-20 21:51:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:51:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_rx_err [2022-02-20 21:51:05,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_rx_err [2022-02-20 21:51:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 21:51:05,235 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 21:51:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-02-20 21:51:05,236 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-02-20 21:51:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:51:05,236 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:51:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-02-20 21:51:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-02-20 21:51:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 21:51:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 21:51:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-02-20 21:51:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-02-20 21:51:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-02-20 21:51:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-02-20 21:51:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:51:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-02-20 21:51:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-02-20 21:51:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:51:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:51:05,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:51:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:51:05,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:51:05,718 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:51:05,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:51:06,019 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:51:06,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-02-20 21:51:08,957 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:51:08,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:51:08,980 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:51:08,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:51:08 BoogieIcfgContainer [2022-02-20 21:51:08,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:51:08,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:51:08,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:51:08,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:51:08,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:51:03" (1/3) ... [2022-02-20 21:51:08,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eadf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:51:08, skipping insertion in model container [2022-02-20 21:51:08,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:04" (2/3) ... [2022-02-20 21:51:08,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eadf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:51:08, skipping insertion in model container [2022-02-20 21:51:08,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:51:08" (3/3) ... [2022-02-20 21:51:08,997 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2022-02-20 21:51:09,001 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:51:09,001 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:51:09,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:51:09,049 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:51:09,049 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:51:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 673 states, 490 states have (on average 1.3510204081632653) internal successors, (662), 514 states have internal predecessors, (662), 135 states have call successors, (135), 48 states have call predecessors, (135), 46 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-02-20 21:51:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 21:51:09,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:51:09,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:51:09,101 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:51:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:51:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash 585131753, now seen corresponding path program 1 times [2022-02-20 21:51:09,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:51:09,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422706726] [2022-02-20 21:51:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:51:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:51:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:09,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:51:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:09,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {687#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {676#true} is VALID [2022-02-20 21:51:09,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {676#true} is VALID [2022-02-20 21:51:09,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2022-02-20 21:51:09,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #1608#return; {676#true} is VALID [2022-02-20 21:51:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:51:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:09,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {687#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {676#true} is VALID [2022-02-20 21:51:09,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {676#true} is VALID [2022-02-20 21:51:09,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2022-02-20 21:51:09,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #1610#return; {676#true} is VALID [2022-02-20 21:51:09,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#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(86, 2);call #Ultimate.allocInit(14, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(26, 5);call #Ultimate.allocInit(63, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(14, 10);call #Ultimate.allocInit(39, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(25, 13);call #Ultimate.allocInit(31, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(28, 16);call #Ultimate.allocInit(28, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(25, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(18, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(22, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(32, 27);call #Ultimate.allocInit(25, 28);call #Ultimate.allocInit(36, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(8, 31);call #Ultimate.allocInit(8, 32);~LDV_IN_INTERRUPT~0 := 1;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ems_usb_netdev_ops_group1~0.base, ~ems_usb_netdev_ops_group1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ldv_state_variable_0~0 := 0;~#ems_usb_table~0.base, ~#ems_usb_table~0.offset := 33, 0;call #Ultimate.allocInit(50, 33);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#ems_usb_table~0.base);call write~unchecked~int(3, ~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, 2);call write~unchecked~int(4822, ~#ems_usb_table~0.base, 2 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(1092, ~#ems_usb_table~0.base, 4 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 6 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 8 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 10 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 11 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 12 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 13 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 14 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 15 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 16 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 17 + ~#ems_usb_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset := 34, 0;call #Ultimate.allocInit(448, 34);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 8 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_open.base, #funAddr~ems_usb_open.offset, ~#ems_usb_netdev_ops~0.base, 16 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_close.base, #funAddr~ems_usb_close.offset, ~#ems_usb_netdev_ops~0.base, 24 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_start_xmit.base, #funAddr~ems_usb_start_xmit.offset, ~#ems_usb_netdev_ops~0.base, 32 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 40 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 48 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 56 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 64 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 72 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 80 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 88 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 96 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 104 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 112 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 120 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 128 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 136 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 144 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 152 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 160 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 168 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 176 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 184 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 192 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 200 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 208 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 216 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 224 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 232 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 240 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 248 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 256 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 264 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 272 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 280 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 288 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 296 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 304 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 312 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 320 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 328 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 336 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 344 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 352 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 360 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 368 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 376 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 384 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 392 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 400 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 408 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 416 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 424 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 432 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 440 + ~#ems_usb_netdev_ops~0.offset, 8);~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset := 35, 0;call #Ultimate.allocInit(48, 35);call write~init~int(101, ~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(109, ~#ems_usb_bittiming_const~0.base, 1 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 2 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(95, ~#ems_usb_bittiming_const~0.base, 3 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(117, ~#ems_usb_bittiming_const~0.base, 4 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 5 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(98, ~#ems_usb_bittiming_const~0.base, 6 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 7 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 8 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 9 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 10 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 11 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 12 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 13 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 14 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 15 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 16 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(16, ~#ems_usb_bittiming_const~0.base, 20 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 24 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(8, ~#ems_usb_bittiming_const~0.base, 28 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(4, ~#ems_usb_bittiming_const~0.base, 32 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 36 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(64, ~#ems_usb_bittiming_const~0.base, 40 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 44 + ~#ems_usb_bittiming_const~0.offset, 4);~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset := 36, 0;call #Ultimate.allocInit(285, 36);call write~init~$Pointer$(31, 0, ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_probe.base, #funAddr~ems_usb_probe.offset, ~#ems_usb_driver~0.base, 8 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_disconnect.base, #funAddr~ems_usb_disconnect.offset, ~#ems_usb_driver~0.base, 16 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 24 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 32 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 40 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 48 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 56 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 64 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, ~#ems_usb_driver~0.base, 72 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 80 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 84 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 88 + ~#ems_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 92 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 100 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 108 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 116 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 124 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 132 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 136 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 148 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 156 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 164 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 172 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 180 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 188 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 196 + ~#ems_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 197 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 205 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 213 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 221 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 229 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 237 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 245 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 253 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 261 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 269 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 277 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 281 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 282 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 283 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 284 + ~#ems_usb_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {676#true} is VALID [2022-02-20 21:51:09,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset, main_#t~ret396#1.base, main_#t~ret396#1.offset, main_#t~nondet397#1, main_#t~switch398#1, main_#t~nondet399#1, main_#t~switch400#1, main_#t~ret401#1, main_#t~nondet402#1, main_#t~switch403#1, main_#t~ret404#1, main_#t~nondet405#1, main_#t~switch406#1, main_#t~ret407#1, main_#t~ret408#1, main_#t~ret409#1, main_#t~ret410#1, main_#t~ret411#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~31#1.base, main_~tmp~31#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~tmp___1~7#1, main_~tmp___2~4#1, main_~tmp___3~1#1, main_~tmp___4~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~31#1.base, main_~tmp~31#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~tmp___1~7#1;havoc main_~tmp___2~4#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1; {676#true} is VALID [2022-02-20 21:51:09,667 INFO L272 TraceCheckUtils]: 2: Hoare triple {676#true} call main_#t~ret395#1.base, main_#t~ret395#1.offset := ldv_zalloc(32); {687#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:09,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {687#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {676#true} is VALID [2022-02-20 21:51:09,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {676#true} is VALID [2022-02-20 21:51:09,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} assume true; {676#true} is VALID [2022-02-20 21:51:09,668 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {676#true} {676#true} #1608#return; {676#true} is VALID [2022-02-20 21:51:09,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {676#true} main_~tmp~31#1.base, main_~tmp~31#1.offset := main_#t~ret395#1.base, main_#t~ret395#1.offset;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~31#1.base, main_~tmp~31#1.offset; {676#true} is VALID [2022-02-20 21:51:09,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {676#true} call main_#t~ret396#1.base, main_#t~ret396#1.offset := ldv_zalloc(240); {687#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:09,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {687#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {676#true} is VALID [2022-02-20 21:51:09,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {676#true} is VALID [2022-02-20 21:51:09,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {676#true} assume true; {676#true} is VALID [2022-02-20 21:51:09,670 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {676#true} {676#true} #1610#return; {676#true} is VALID [2022-02-20 21:51:09,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {676#true} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret396#1.base, main_#t~ret396#1.offset;havoc main_#t~ret396#1.base, main_#t~ret396#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;assume { :begin_inline_ldv_initialize } true; {676#true} is VALID [2022-02-20 21:51:09,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {686#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:51:09,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {686#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet397#1 && main_#t~nondet397#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet397#1;havoc main_#t~nondet397#1;main_#t~switch398#1 := 0 == main_~tmp___1~7#1; {686#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:51:09,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {686#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch398#1;main_#t~switch398#1 := main_#t~switch398#1 || 1 == main_~tmp___1~7#1; {686#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:51:09,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {686#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch398#1; {686#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:51:09,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet402#1 && main_#t~nondet402#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet402#1;havoc main_#t~nondet402#1;main_#t~switch403#1 := 0 == main_~tmp___3~1#1; {686#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:51:09,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {686#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch403#1; {686#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:51:09,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {686#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_ems_usb_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_24 } true;ldv_usb_deregister_24_#in~arg#1.base, ldv_usb_deregister_24_#in~arg#1.offset := ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset;havoc ldv_usb_deregister_24_~arg#1.base, ldv_usb_deregister_24_~arg#1.offset;ldv_usb_deregister_24_~arg#1.base, ldv_usb_deregister_24_~arg#1.offset := ldv_usb_deregister_24_#in~arg#1.base, ldv_usb_deregister_24_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_24_~arg#1.base, ldv_usb_deregister_24_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {677#false} is VALID [2022-02-20 21:51:09,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {677#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {677#false} is VALID [2022-02-20 21:51:09,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {677#false} assume { :end_inline_ldv_usb_deregister_24 } true; {677#false} is VALID [2022-02-20 21:51:09,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {677#false} assume { :end_inline_ems_usb_driver_exit } true;~ldv_state_variable_0~0 := 2; {677#false} is VALID [2022-02-20 21:51:09,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {677#false} assume { :begin_inline_ldv_check_final_state } true; {677#false} is VALID [2022-02-20 21:51:09,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {677#false} assume !(0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {677#false} is VALID [2022-02-20 21:51:09,678 INFO L272 TraceCheckUtils]: 26: Hoare triple {677#false} call ldv_error(); {677#false} is VALID [2022-02-20 21:51:09,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {677#false} assume !false; {677#false} is VALID [2022-02-20 21:51:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 21:51:09,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:51:09,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422706726] [2022-02-20 21:51:09,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422706726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:51:09,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:51:09,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:51:09,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382993850] [2022-02-20 21:51:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:51:09,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 21:51:09,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:51:09,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:51:09,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:09,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:51:09,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:51:09,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:51:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:51:09,770 INFO L87 Difference]: Start difference. First operand has 673 states, 490 states have (on average 1.3510204081632653) internal successors, (662), 514 states have internal predecessors, (662), 135 states have call successors, (135), 48 states have call predecessors, (135), 46 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:51:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:19,512 INFO L93 Difference]: Finished difference Result 2125 states and 3041 transitions. [2022-02-20 21:51:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:51:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 21:51:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:51:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:51:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3041 transitions. [2022-02-20 21:51:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:51:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3041 transitions. [2022-02-20 21:51:19,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3041 transitions. [2022-02-20 21:51:22,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3041 edges. 3041 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:22,397 INFO L225 Difference]: With dead ends: 2125 [2022-02-20 21:51:22,397 INFO L226 Difference]: Without dead ends: 1433 [2022-02-20 21:51:22,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:51:22,407 INFO L933 BasicCegarLoop]: 970 mSDtfsCounter, 1298 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:51:22,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1391 Valid, 2017 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 21:51:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-02-20 21:51:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1283. [2022-02-20 21:51:22,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:51:22,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1433 states. Second operand has 1283 states, 943 states have (on average 1.3160127253446448) internal successors, (1241), 971 states have internal predecessors, (1241), 249 states have call successors, (249), 91 states have call predecessors, (249), 90 states have return successors, (244), 234 states have call predecessors, (244), 244 states have call successors, (244) [2022-02-20 21:51:22,559 INFO L74 IsIncluded]: Start isIncluded. First operand 1433 states. Second operand has 1283 states, 943 states have (on average 1.3160127253446448) internal successors, (1241), 971 states have internal predecessors, (1241), 249 states have call successors, (249), 91 states have call predecessors, (249), 90 states have return successors, (244), 234 states have call predecessors, (244), 244 states have call successors, (244) [2022-02-20 21:51:22,563 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand has 1283 states, 943 states have (on average 1.3160127253446448) internal successors, (1241), 971 states have internal predecessors, (1241), 249 states have call successors, (249), 91 states have call predecessors, (249), 90 states have return successors, (244), 234 states have call predecessors, (244), 244 states have call successors, (244) [2022-02-20 21:51:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:22,687 INFO L93 Difference]: Finished difference Result 1433 states and 1978 transitions. [2022-02-20 21:51:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1978 transitions. [2022-02-20 21:51:22,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:22,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 1283 states, 943 states have (on average 1.3160127253446448) internal successors, (1241), 971 states have internal predecessors, (1241), 249 states have call successors, (249), 91 states have call predecessors, (249), 90 states have return successors, (244), 234 states have call predecessors, (244), 244 states have call successors, (244) Second operand 1433 states. [2022-02-20 21:51:22,713 INFO L87 Difference]: Start difference. First operand has 1283 states, 943 states have (on average 1.3160127253446448) internal successors, (1241), 971 states have internal predecessors, (1241), 249 states have call successors, (249), 91 states have call predecessors, (249), 90 states have return successors, (244), 234 states have call predecessors, (244), 244 states have call successors, (244) Second operand 1433 states. [2022-02-20 21:51:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:22,837 INFO L93 Difference]: Finished difference Result 1433 states and 1978 transitions. [2022-02-20 21:51:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1978 transitions. [2022-02-20 21:51:22,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:22,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:22,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:51:22,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:51:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 943 states have (on average 1.3160127253446448) internal successors, (1241), 971 states have internal predecessors, (1241), 249 states have call successors, (249), 91 states have call predecessors, (249), 90 states have return successors, (244), 234 states have call predecessors, (244), 244 states have call successors, (244) [2022-02-20 21:51:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1734 transitions. [2022-02-20 21:51:22,970 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1734 transitions. Word has length 28 [2022-02-20 21:51:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:51:22,971 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1734 transitions. [2022-02-20 21:51:22,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:51:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1734 transitions. [2022-02-20 21:51:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 21:51:22,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:51:22,978 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] [2022-02-20 21:51:22,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:51:22,978 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:51:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:51:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1772394292, now seen corresponding path program 1 times [2022-02-20 21:51:22,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:51:22,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005795912] [2022-02-20 21:51:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:51:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:51:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:51:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:23,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {8388#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {8373#true} is VALID [2022-02-20 21:51:23,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {8373#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8373#true} is VALID [2022-02-20 21:51:23,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {8373#true} assume true; {8373#true} is VALID [2022-02-20 21:51:23,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8373#true} {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1608#return; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:51:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:23,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {8388#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {8373#true} is VALID [2022-02-20 21:51:23,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {8373#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8373#true} is VALID [2022-02-20 21:51:23,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {8373#true} assume true; {8373#true} is VALID [2022-02-20 21:51:23,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8373#true} {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1610#return; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:51:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:23,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {8388#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {8373#true} is VALID [2022-02-20 21:51:23,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {8373#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8373#true} is VALID [2022-02-20 21:51:23,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {8373#true} assume true; {8373#true} is VALID [2022-02-20 21:51:23,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8373#true} {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1648#return; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {8373#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(86, 2);call #Ultimate.allocInit(14, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(26, 5);call #Ultimate.allocInit(63, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(14, 10);call #Ultimate.allocInit(39, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(25, 13);call #Ultimate.allocInit(31, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(28, 16);call #Ultimate.allocInit(28, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(25, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(18, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(22, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(32, 27);call #Ultimate.allocInit(25, 28);call #Ultimate.allocInit(36, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(8, 31);call #Ultimate.allocInit(8, 32);~LDV_IN_INTERRUPT~0 := 1;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ems_usb_netdev_ops_group1~0.base, ~ems_usb_netdev_ops_group1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ldv_state_variable_0~0 := 0;~#ems_usb_table~0.base, ~#ems_usb_table~0.offset := 33, 0;call #Ultimate.allocInit(50, 33);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#ems_usb_table~0.base);call write~unchecked~int(3, ~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, 2);call write~unchecked~int(4822, ~#ems_usb_table~0.base, 2 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(1092, ~#ems_usb_table~0.base, 4 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 6 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 8 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 10 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 11 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 12 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 13 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 14 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 15 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 16 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 17 + ~#ems_usb_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset := 34, 0;call #Ultimate.allocInit(448, 34);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 8 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_open.base, #funAddr~ems_usb_open.offset, ~#ems_usb_netdev_ops~0.base, 16 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_close.base, #funAddr~ems_usb_close.offset, ~#ems_usb_netdev_ops~0.base, 24 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_start_xmit.base, #funAddr~ems_usb_start_xmit.offset, ~#ems_usb_netdev_ops~0.base, 32 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 40 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 48 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 56 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 64 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 72 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 80 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 88 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 96 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 104 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 112 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 120 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 128 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 136 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 144 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 152 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 160 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 168 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 176 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 184 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 192 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 200 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 208 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 216 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 224 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 232 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 240 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 248 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 256 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 264 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 272 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 280 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 288 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 296 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 304 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 312 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 320 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 328 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 336 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 344 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 352 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 360 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 368 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 376 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 384 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 392 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 400 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 408 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 416 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 424 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 432 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 440 + ~#ems_usb_netdev_ops~0.offset, 8);~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset := 35, 0;call #Ultimate.allocInit(48, 35);call write~init~int(101, ~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(109, ~#ems_usb_bittiming_const~0.base, 1 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 2 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(95, ~#ems_usb_bittiming_const~0.base, 3 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(117, ~#ems_usb_bittiming_const~0.base, 4 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 5 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(98, ~#ems_usb_bittiming_const~0.base, 6 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 7 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 8 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 9 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 10 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 11 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 12 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 13 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 14 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 15 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 16 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(16, ~#ems_usb_bittiming_const~0.base, 20 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 24 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(8, ~#ems_usb_bittiming_const~0.base, 28 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(4, ~#ems_usb_bittiming_const~0.base, 32 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 36 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(64, ~#ems_usb_bittiming_const~0.base, 40 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 44 + ~#ems_usb_bittiming_const~0.offset, 4);~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset := 36, 0;call #Ultimate.allocInit(285, 36);call write~init~$Pointer$(31, 0, ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_probe.base, #funAddr~ems_usb_probe.offset, ~#ems_usb_driver~0.base, 8 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_disconnect.base, #funAddr~ems_usb_disconnect.offset, ~#ems_usb_driver~0.base, 16 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 24 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 32 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 40 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 48 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 56 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 64 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, ~#ems_usb_driver~0.base, 72 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 80 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 84 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 88 + ~#ems_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 92 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 100 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 108 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 116 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 124 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 132 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 136 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 148 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 156 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 164 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 172 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 180 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 188 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 196 + ~#ems_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 197 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 205 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 213 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 221 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 229 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 237 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 245 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 253 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 261 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 269 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 277 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 281 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 282 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 283 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 284 + ~#ems_usb_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset, main_#t~ret396#1.base, main_#t~ret396#1.offset, main_#t~nondet397#1, main_#t~switch398#1, main_#t~nondet399#1, main_#t~switch400#1, main_#t~ret401#1, main_#t~nondet402#1, main_#t~switch403#1, main_#t~ret404#1, main_#t~nondet405#1, main_#t~switch406#1, main_#t~ret407#1, main_#t~ret408#1, main_#t~ret409#1, main_#t~ret410#1, main_#t~ret411#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~31#1.base, main_~tmp~31#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~tmp___1~7#1, main_~tmp___2~4#1, main_~tmp___3~1#1, main_~tmp___4~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~31#1.base, main_~tmp~31#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~tmp___1~7#1;havoc main_~tmp___2~4#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,231 INFO L272 TraceCheckUtils]: 2: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret395#1.base, main_#t~ret395#1.offset := ldv_zalloc(32); {8388#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:23,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {8388#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {8373#true} is VALID [2022-02-20 21:51:23,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {8373#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8373#true} is VALID [2022-02-20 21:51:23,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {8373#true} assume true; {8373#true} is VALID [2022-02-20 21:51:23,234 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8373#true} {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1608#return; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp~31#1.base, main_~tmp~31#1.offset := main_#t~ret395#1.base, main_#t~ret395#1.offset;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~31#1.base, main_~tmp~31#1.offset; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,235 INFO L272 TraceCheckUtils]: 8: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret396#1.base, main_#t~ret396#1.offset := ldv_zalloc(240); {8388#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:23,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {8388#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {8373#true} is VALID [2022-02-20 21:51:23,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {8373#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8373#true} is VALID [2022-02-20 21:51:23,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {8373#true} assume true; {8373#true} is VALID [2022-02-20 21:51:23,237 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8373#true} {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1610#return; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret396#1.base, main_#t~ret396#1.offset;havoc main_#t~ret396#1.base, main_#t~ret396#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;assume { :begin_inline_ldv_initialize } true; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume -2147483648 <= main_#t~nondet397#1 && main_#t~nondet397#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet397#1;havoc main_#t~nondet397#1;main_#t~switch398#1 := 0 == main_~tmp___1~7#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch398#1;main_#t~switch398#1 := main_#t~switch398#1 || 1 == main_~tmp___1~7#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch398#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet402#1 && main_#t~nondet402#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet402#1;havoc main_#t~nondet402#1;main_#t~switch403#1 := 0 == main_~tmp___3~1#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch403#1;main_#t~switch403#1 := main_#t~switch403#1 || 1 == main_~tmp___3~1#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch403#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ems_usb_driver_init } true;havoc ems_usb_driver_init_#res#1;havoc ems_usb_driver_init_#t~ret392#1, ems_usb_driver_init_~tmp~28#1;havoc ems_usb_driver_init_~tmp~28#1;assume { :begin_inline_ldv_usb_register_driver_23 } true;ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset := ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 32, 0;havoc ldv_usb_register_driver_23_#res#1;havoc ldv_usb_register_driver_23_#t~ret422#1, ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset, ldv_usb_register_driver_23_~ldv_func_res~0#1, ldv_usb_register_driver_23_~tmp~42#1;ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_23_~ldv_func_res~0#1;havoc ldv_usb_register_driver_23_~tmp~42#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet449#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet449#1 && usb_register_driver_#t~nondet449#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet449#1;havoc usb_register_driver_#t~nondet449#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} ldv_usb_register_driver_23_#t~ret422#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_23_#t~ret422#1 && ldv_usb_register_driver_23_#t~ret422#1 <= 2147483647;ldv_usb_register_driver_23_~tmp~42#1 := ldv_usb_register_driver_23_#t~ret422#1;havoc ldv_usb_register_driver_23_#t~ret422#1;ldv_usb_register_driver_23_~ldv_func_res~0#1 := ldv_usb_register_driver_23_~tmp~42#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset, ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset;havoc ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,244 INFO L272 TraceCheckUtils]: 23: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset := ldv_zalloc(1520); {8388#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:23,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {8388#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {8373#true} is VALID [2022-02-20 21:51:23,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {8373#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8373#true} is VALID [2022-02-20 21:51:23,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {8373#true} assume true; {8373#true} is VALID [2022-02-20 21:51:23,245 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8373#true} {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1648#return; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset := ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_23_#res#1 := ldv_usb_register_driver_23_~ldv_func_res~0#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} ems_usb_driver_init_#t~ret392#1 := ldv_usb_register_driver_23_#res#1;assume { :end_inline_ldv_usb_register_driver_23 } true;assume -2147483648 <= ems_usb_driver_init_#t~ret392#1 && ems_usb_driver_init_#t~ret392#1 <= 2147483647;ems_usb_driver_init_~tmp~28#1 := ems_usb_driver_init_#t~ret392#1;havoc ems_usb_driver_init_#t~ret392#1;ems_usb_driver_init_#res#1 := ems_usb_driver_init_~tmp~28#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_#t~ret404#1 := ems_usb_driver_init_#res#1;assume { :end_inline_ems_usb_driver_init } true;assume -2147483648 <= main_#t~ret404#1 && main_#t~ret404#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret404#1;havoc main_#t~ret404#1; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == ~ldv_retval_1~0); {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:51:23,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {8375#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {8374#false} is VALID [2022-02-20 21:51:23,250 INFO L272 TraceCheckUtils]: 36: Hoare triple {8374#false} call ldv_error(); {8374#false} is VALID [2022-02-20 21:51:23,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {8374#false} assume !false; {8374#false} is VALID [2022-02-20 21:51:23,251 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:51:23,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:51:23,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005795912] [2022-02-20 21:51:23,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005795912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:51:23,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:51:23,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:51:23,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878830955] [2022-02-20 21:51:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:51:23,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-02-20 21:51:23,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:51:23,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:23,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:23,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:51:23,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:51:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:51:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:51:23,299 INFO L87 Difference]: Start difference. First operand 1283 states and 1734 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:31,764 INFO L93 Difference]: Finished difference Result 4134 states and 5797 transitions. [2022-02-20 21:51:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:51:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-02-20 21:51:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:51:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2958 transitions. [2022-02-20 21:51:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2958 transitions. [2022-02-20 21:51:31,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2958 transitions. [2022-02-20 21:51:34,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2958 edges. 2958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:35,138 INFO L225 Difference]: With dead ends: 4134 [2022-02-20 21:51:35,138 INFO L226 Difference]: Without dead ends: 2858 [2022-02-20 21:51:35,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:51:35,147 INFO L933 BasicCegarLoop]: 1061 mSDtfsCounter, 1303 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:51:35,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1382 Valid, 2146 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 21:51:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2022-02-20 21:51:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2652. [2022-02-20 21:51:35,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:51:35,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2858 states. Second operand has 2652 states, 1952 states have (on average 1.3165983606557377) internal successors, (2570), 2016 states have internal predecessors, (2570), 505 states have call successors, (505), 181 states have call predecessors, (505), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:35,286 INFO L74 IsIncluded]: Start isIncluded. First operand 2858 states. Second operand has 2652 states, 1952 states have (on average 1.3165983606557377) internal successors, (2570), 2016 states have internal predecessors, (2570), 505 states have call successors, (505), 181 states have call predecessors, (505), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:35,294 INFO L87 Difference]: Start difference. First operand 2858 states. Second operand has 2652 states, 1952 states have (on average 1.3165983606557377) internal successors, (2570), 2016 states have internal predecessors, (2570), 505 states have call successors, (505), 181 states have call predecessors, (505), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:35,706 INFO L93 Difference]: Finished difference Result 2858 states and 3997 transitions. [2022-02-20 21:51:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3997 transitions. [2022-02-20 21:51:35,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:35,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:35,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 2652 states, 1952 states have (on average 1.3165983606557377) internal successors, (2570), 2016 states have internal predecessors, (2570), 505 states have call successors, (505), 181 states have call predecessors, (505), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) Second operand 2858 states. [2022-02-20 21:51:35,748 INFO L87 Difference]: Start difference. First operand has 2652 states, 1952 states have (on average 1.3165983606557377) internal successors, (2570), 2016 states have internal predecessors, (2570), 505 states have call successors, (505), 181 states have call predecessors, (505), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) Second operand 2858 states. [2022-02-20 21:51:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:36,174 INFO L93 Difference]: Finished difference Result 2858 states and 3997 transitions. [2022-02-20 21:51:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3997 transitions. [2022-02-20 21:51:36,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:36,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:36,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:51:36,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:51:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 1952 states have (on average 1.3165983606557377) internal successors, (2570), 2016 states have internal predecessors, (2570), 505 states have call successors, (505), 181 states have call predecessors, (505), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2022-02-20 21:51:36,721 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 38 [2022-02-20 21:51:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:51:36,721 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2022-02-20 21:51:36,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2022-02-20 21:51:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 21:51:36,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:51:36,723 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] [2022-02-20 21:51:36,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:51:36,724 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:51:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:51:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -890663808, now seen corresponding path program 1 times [2022-02-20 21:51:36,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:51:36,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57648889] [2022-02-20 21:51:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:51:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:51:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:51:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:36,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {23651#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {23636#true} is VALID [2022-02-20 21:51:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {23636#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {23636#true} is VALID [2022-02-20 21:51:36,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {23636#true} assume true; {23636#true} is VALID [2022-02-20 21:51:36,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23636#true} {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1608#return; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:51:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:36,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {23651#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {23636#true} is VALID [2022-02-20 21:51:36,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {23636#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {23636#true} is VALID [2022-02-20 21:51:36,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {23636#true} assume true; {23636#true} is VALID [2022-02-20 21:51:36,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23636#true} {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1610#return; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:51:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:36,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {23651#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {23636#true} is VALID [2022-02-20 21:51:36,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {23636#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {23636#true} is VALID [2022-02-20 21:51:36,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {23636#true} assume true; {23636#true} is VALID [2022-02-20 21:51:36,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23636#true} {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1648#return; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {23636#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(86, 2);call #Ultimate.allocInit(14, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(26, 5);call #Ultimate.allocInit(63, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(14, 10);call #Ultimate.allocInit(39, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(25, 13);call #Ultimate.allocInit(31, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(28, 16);call #Ultimate.allocInit(28, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(25, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(18, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(22, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(32, 27);call #Ultimate.allocInit(25, 28);call #Ultimate.allocInit(36, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(8, 31);call #Ultimate.allocInit(8, 32);~LDV_IN_INTERRUPT~0 := 1;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ems_usb_netdev_ops_group1~0.base, ~ems_usb_netdev_ops_group1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ldv_state_variable_0~0 := 0;~#ems_usb_table~0.base, ~#ems_usb_table~0.offset := 33, 0;call #Ultimate.allocInit(50, 33);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#ems_usb_table~0.base);call write~unchecked~int(3, ~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, 2);call write~unchecked~int(4822, ~#ems_usb_table~0.base, 2 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(1092, ~#ems_usb_table~0.base, 4 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 6 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 8 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 10 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 11 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 12 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 13 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 14 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 15 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 16 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 17 + ~#ems_usb_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset := 34, 0;call #Ultimate.allocInit(448, 34);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 8 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_open.base, #funAddr~ems_usb_open.offset, ~#ems_usb_netdev_ops~0.base, 16 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_close.base, #funAddr~ems_usb_close.offset, ~#ems_usb_netdev_ops~0.base, 24 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_start_xmit.base, #funAddr~ems_usb_start_xmit.offset, ~#ems_usb_netdev_ops~0.base, 32 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 40 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 48 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 56 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 64 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 72 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 80 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 88 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 96 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 104 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 112 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 120 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 128 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 136 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 144 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 152 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 160 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 168 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 176 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 184 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 192 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 200 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 208 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 216 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 224 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 232 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 240 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 248 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 256 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 264 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 272 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 280 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 288 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 296 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 304 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 312 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 320 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 328 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 336 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 344 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 352 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 360 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 368 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 376 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 384 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 392 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 400 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 408 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 416 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 424 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 432 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 440 + ~#ems_usb_netdev_ops~0.offset, 8);~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset := 35, 0;call #Ultimate.allocInit(48, 35);call write~init~int(101, ~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(109, ~#ems_usb_bittiming_const~0.base, 1 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 2 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(95, ~#ems_usb_bittiming_const~0.base, 3 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(117, ~#ems_usb_bittiming_const~0.base, 4 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 5 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(98, ~#ems_usb_bittiming_const~0.base, 6 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 7 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 8 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 9 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 10 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 11 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 12 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 13 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 14 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 15 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 16 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(16, ~#ems_usb_bittiming_const~0.base, 20 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 24 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(8, ~#ems_usb_bittiming_const~0.base, 28 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(4, ~#ems_usb_bittiming_const~0.base, 32 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 36 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(64, ~#ems_usb_bittiming_const~0.base, 40 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 44 + ~#ems_usb_bittiming_const~0.offset, 4);~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset := 36, 0;call #Ultimate.allocInit(285, 36);call write~init~$Pointer$(31, 0, ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_probe.base, #funAddr~ems_usb_probe.offset, ~#ems_usb_driver~0.base, 8 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_disconnect.base, #funAddr~ems_usb_disconnect.offset, ~#ems_usb_driver~0.base, 16 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 24 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 32 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 40 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 48 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 56 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 64 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, ~#ems_usb_driver~0.base, 72 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 80 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 84 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 88 + ~#ems_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 92 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 100 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 108 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 116 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 124 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 132 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 136 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 148 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 156 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 164 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 172 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 180 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 188 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 196 + ~#ems_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 197 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 205 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 213 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 221 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 229 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 237 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 245 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 253 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 261 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 269 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 277 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 281 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 282 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 283 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 284 + ~#ems_usb_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset, main_#t~ret396#1.base, main_#t~ret396#1.offset, main_#t~nondet397#1, main_#t~switch398#1, main_#t~nondet399#1, main_#t~switch400#1, main_#t~ret401#1, main_#t~nondet402#1, main_#t~switch403#1, main_#t~ret404#1, main_#t~nondet405#1, main_#t~switch406#1, main_#t~ret407#1, main_#t~ret408#1, main_#t~ret409#1, main_#t~ret410#1, main_#t~ret411#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~31#1.base, main_~tmp~31#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~tmp___1~7#1, main_~tmp___2~4#1, main_~tmp___3~1#1, main_~tmp___4~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~31#1.base, main_~tmp~31#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~tmp___1~7#1;havoc main_~tmp___2~4#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,952 INFO L272 TraceCheckUtils]: 2: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret395#1.base, main_#t~ret395#1.offset := ldv_zalloc(32); {23651#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:36,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {23651#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {23636#true} is VALID [2022-02-20 21:51:36,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {23636#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {23636#true} is VALID [2022-02-20 21:51:36,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {23636#true} assume true; {23636#true} is VALID [2022-02-20 21:51:36,953 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23636#true} {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1608#return; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp~31#1.base, main_~tmp~31#1.offset := main_#t~ret395#1.base, main_#t~ret395#1.offset;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~31#1.base, main_~tmp~31#1.offset; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,955 INFO L272 TraceCheckUtils]: 8: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret396#1.base, main_#t~ret396#1.offset := ldv_zalloc(240); {23651#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:36,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {23651#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {23636#true} is VALID [2022-02-20 21:51:36,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {23636#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {23636#true} is VALID [2022-02-20 21:51:36,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {23636#true} assume true; {23636#true} is VALID [2022-02-20 21:51:36,960 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23636#true} {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1610#return; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret396#1.base, main_#t~ret396#1.offset;havoc main_#t~ret396#1.base, main_#t~ret396#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;assume { :begin_inline_ldv_initialize } true; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume -2147483648 <= main_#t~nondet397#1 && main_#t~nondet397#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet397#1;havoc main_#t~nondet397#1;main_#t~switch398#1 := 0 == main_~tmp___1~7#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch398#1;main_#t~switch398#1 := main_#t~switch398#1 || 1 == main_~tmp___1~7#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch398#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet402#1 && main_#t~nondet402#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet402#1;havoc main_#t~nondet402#1;main_#t~switch403#1 := 0 == main_~tmp___3~1#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch403#1;main_#t~switch403#1 := main_#t~switch403#1 || 1 == main_~tmp___3~1#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch403#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ems_usb_driver_init } true;havoc ems_usb_driver_init_#res#1;havoc ems_usb_driver_init_#t~ret392#1, ems_usb_driver_init_~tmp~28#1;havoc ems_usb_driver_init_~tmp~28#1;assume { :begin_inline_ldv_usb_register_driver_23 } true;ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset := ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 32, 0;havoc ldv_usb_register_driver_23_#res#1;havoc ldv_usb_register_driver_23_#t~ret422#1, ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset, ldv_usb_register_driver_23_~ldv_func_res~0#1, ldv_usb_register_driver_23_~tmp~42#1;ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_23_~ldv_func_res~0#1;havoc ldv_usb_register_driver_23_~tmp~42#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet449#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet449#1 && usb_register_driver_#t~nondet449#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet449#1;havoc usb_register_driver_#t~nondet449#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} ldv_usb_register_driver_23_#t~ret422#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_23_#t~ret422#1 && ldv_usb_register_driver_23_#t~ret422#1 <= 2147483647;ldv_usb_register_driver_23_~tmp~42#1 := ldv_usb_register_driver_23_#t~ret422#1;havoc ldv_usb_register_driver_23_#t~ret422#1;ldv_usb_register_driver_23_~ldv_func_res~0#1 := ldv_usb_register_driver_23_~tmp~42#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset, ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset;havoc ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,966 INFO L272 TraceCheckUtils]: 23: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset := ldv_zalloc(1520); {23651#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:36,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {23651#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {23636#true} is VALID [2022-02-20 21:51:36,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {23636#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {23636#true} is VALID [2022-02-20 21:51:36,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {23636#true} assume true; {23636#true} is VALID [2022-02-20 21:51:36,967 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23636#true} {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1648#return; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset := ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_23_#res#1 := ldv_usb_register_driver_23_~ldv_func_res~0#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} ems_usb_driver_init_#t~ret392#1 := ldv_usb_register_driver_23_#res#1;assume { :end_inline_ldv_usb_register_driver_23 } true;assume -2147483648 <= ems_usb_driver_init_#t~ret392#1 && ems_usb_driver_init_#t~ret392#1 <= 2147483647;ems_usb_driver_init_~tmp~28#1 := ems_usb_driver_init_#t~ret392#1;havoc ems_usb_driver_init_#t~ret392#1;ems_usb_driver_init_#res#1 := ems_usb_driver_init_~tmp~28#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_#t~ret404#1 := ems_usb_driver_init_#res#1;assume { :end_inline_ems_usb_driver_init } true;assume -2147483648 <= main_#t~ret404#1 && main_#t~ret404#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret404#1;havoc main_#t~ret404#1; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == ~ldv_retval_1~0); {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:51:36,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {23638#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616); {23637#false} is VALID [2022-02-20 21:51:36,972 INFO L272 TraceCheckUtils]: 37: Hoare triple {23637#false} call ldv_error(); {23637#false} is VALID [2022-02-20 21:51:36,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {23637#false} assume !false; {23637#false} is VALID [2022-02-20 21:51:36,973 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:51:36,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:51:36,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57648889] [2022-02-20 21:51:36,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57648889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:51:36,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:51:36,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:51:36,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261920040] [2022-02-20 21:51:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:51:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-02-20 21:51:36,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:51:36,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:37,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:37,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:51:37,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:51:37,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:51:37,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:51:37,011 INFO L87 Difference]: Start difference. First operand 2652 states and 3651 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:42,865 INFO L93 Difference]: Finished difference Result 2850 states and 3986 transitions. [2022-02-20 21:51:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:51:42,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-02-20 21:51:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:51:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1014 transitions. [2022-02-20 21:51:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1014 transitions. [2022-02-20 21:51:42,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1014 transitions. [2022-02-20 21:51:43,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1014 edges. 1014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:44,244 INFO L225 Difference]: With dead ends: 2850 [2022-02-20 21:51:44,247 INFO L226 Difference]: Without dead ends: 2847 [2022-02-20 21:51:44,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:51:44,252 INFO L933 BasicCegarLoop]: 843 mSDtfsCounter, 1057 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:51:44,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 1209 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 21:51:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2022-02-20 21:51:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2651. [2022-02-20 21:51:44,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:51:44,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2847 states. Second operand has 2651 states, 1952 states have (on average 1.3160860655737705) internal successors, (2569), 2015 states have internal predecessors, (2569), 504 states have call successors, (504), 181 states have call predecessors, (504), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:44,360 INFO L74 IsIncluded]: Start isIncluded. First operand 2847 states. Second operand has 2651 states, 1952 states have (on average 1.3160860655737705) internal successors, (2569), 2015 states have internal predecessors, (2569), 504 states have call successors, (504), 181 states have call predecessors, (504), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:44,366 INFO L87 Difference]: Start difference. First operand 2847 states. Second operand has 2651 states, 1952 states have (on average 1.3160860655737705) internal successors, (2569), 2015 states have internal predecessors, (2569), 504 states have call successors, (504), 181 states have call predecessors, (504), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:44,746 INFO L93 Difference]: Finished difference Result 2847 states and 3983 transitions. [2022-02-20 21:51:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3983 transitions. [2022-02-20 21:51:44,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:44,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:44,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 2651 states, 1952 states have (on average 1.3160860655737705) internal successors, (2569), 2015 states have internal predecessors, (2569), 504 states have call successors, (504), 181 states have call predecessors, (504), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) Second operand 2847 states. [2022-02-20 21:51:44,766 INFO L87 Difference]: Start difference. First operand has 2651 states, 1952 states have (on average 1.3160860655737705) internal successors, (2569), 2015 states have internal predecessors, (2569), 504 states have call successors, (504), 181 states have call predecessors, (504), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) Second operand 2847 states. [2022-02-20 21:51:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:45,080 INFO L93 Difference]: Finished difference Result 2847 states and 3983 transitions. [2022-02-20 21:51:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3983 transitions. [2022-02-20 21:51:45,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:45,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:45,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:51:45,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:51:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 1952 states have (on average 1.3160860655737705) internal successors, (2569), 2015 states have internal predecessors, (2569), 504 states have call successors, (504), 181 states have call predecessors, (504), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3649 transitions. [2022-02-20 21:51:45,499 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3649 transitions. Word has length 39 [2022-02-20 21:51:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:51:45,499 INFO L470 AbstractCegarLoop]: Abstraction has 2651 states and 3649 transitions. [2022-02-20 21:51:45,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3649 transitions. [2022-02-20 21:51:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 21:51:45,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:51:45,500 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] [2022-02-20 21:51:45,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:51:45,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:51:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:51:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1841081417, now seen corresponding path program 1 times [2022-02-20 21:51:45,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:51:45,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246811293] [2022-02-20 21:51:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:51:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:51:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:51:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:45,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {37073#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {37058#true} is VALID [2022-02-20 21:51:45,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {37058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {37058#true} is VALID [2022-02-20 21:51:45,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 21:51:45,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37058#true} {37060#(= ~dev_counter~0 0)} #1608#return; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:51:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:45,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {37073#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {37058#true} is VALID [2022-02-20 21:51:45,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {37058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {37058#true} is VALID [2022-02-20 21:51:45,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 21:51:45,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37058#true} {37060#(= ~dev_counter~0 0)} #1610#return; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:51:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:45,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {37073#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {37058#true} is VALID [2022-02-20 21:51:45,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {37058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {37058#true} is VALID [2022-02-20 21:51:45,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 21:51:45,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37058#true} {37060#(= ~dev_counter~0 0)} #1648#return; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {37058#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(86, 2);call #Ultimate.allocInit(14, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(26, 5);call #Ultimate.allocInit(63, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(14, 10);call #Ultimate.allocInit(39, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(25, 13);call #Ultimate.allocInit(31, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(28, 16);call #Ultimate.allocInit(28, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(25, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(18, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(22, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(32, 27);call #Ultimate.allocInit(25, 28);call #Ultimate.allocInit(36, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(8, 31);call #Ultimate.allocInit(8, 32);~LDV_IN_INTERRUPT~0 := 1;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ems_usb_netdev_ops_group1~0.base, ~ems_usb_netdev_ops_group1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ldv_state_variable_0~0 := 0;~#ems_usb_table~0.base, ~#ems_usb_table~0.offset := 33, 0;call #Ultimate.allocInit(50, 33);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#ems_usb_table~0.base);call write~unchecked~int(3, ~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, 2);call write~unchecked~int(4822, ~#ems_usb_table~0.base, 2 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(1092, ~#ems_usb_table~0.base, 4 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 6 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 8 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 10 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 11 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 12 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 13 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 14 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 15 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 16 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 17 + ~#ems_usb_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset := 34, 0;call #Ultimate.allocInit(448, 34);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 8 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_open.base, #funAddr~ems_usb_open.offset, ~#ems_usb_netdev_ops~0.base, 16 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_close.base, #funAddr~ems_usb_close.offset, ~#ems_usb_netdev_ops~0.base, 24 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_start_xmit.base, #funAddr~ems_usb_start_xmit.offset, ~#ems_usb_netdev_ops~0.base, 32 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 40 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 48 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 56 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 64 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 72 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 80 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 88 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 96 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 104 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 112 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 120 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 128 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 136 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 144 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 152 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 160 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 168 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 176 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 184 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 192 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 200 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 208 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 216 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 224 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 232 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 240 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 248 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 256 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 264 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 272 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 280 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 288 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 296 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 304 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 312 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 320 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 328 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 336 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 344 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 352 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 360 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 368 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 376 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 384 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 392 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 400 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 408 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 416 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 424 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 432 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 440 + ~#ems_usb_netdev_ops~0.offset, 8);~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset := 35, 0;call #Ultimate.allocInit(48, 35);call write~init~int(101, ~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(109, ~#ems_usb_bittiming_const~0.base, 1 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 2 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(95, ~#ems_usb_bittiming_const~0.base, 3 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(117, ~#ems_usb_bittiming_const~0.base, 4 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 5 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(98, ~#ems_usb_bittiming_const~0.base, 6 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 7 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 8 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 9 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 10 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 11 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 12 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 13 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 14 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 15 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 16 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(16, ~#ems_usb_bittiming_const~0.base, 20 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 24 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(8, ~#ems_usb_bittiming_const~0.base, 28 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(4, ~#ems_usb_bittiming_const~0.base, 32 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 36 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(64, ~#ems_usb_bittiming_const~0.base, 40 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 44 + ~#ems_usb_bittiming_const~0.offset, 4);~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset := 36, 0;call #Ultimate.allocInit(285, 36);call write~init~$Pointer$(31, 0, ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_probe.base, #funAddr~ems_usb_probe.offset, ~#ems_usb_driver~0.base, 8 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_disconnect.base, #funAddr~ems_usb_disconnect.offset, ~#ems_usb_driver~0.base, 16 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 24 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 32 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 40 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 48 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 56 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 64 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, ~#ems_usb_driver~0.base, 72 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 80 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 84 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 88 + ~#ems_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 92 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 100 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 108 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 116 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 124 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 132 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 136 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 148 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 156 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 164 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 172 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 180 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 188 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 196 + ~#ems_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 197 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 205 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 213 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 221 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 229 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 237 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 245 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 253 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 261 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 269 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 277 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 281 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 282 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 283 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 284 + ~#ems_usb_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {37060#(= ~dev_counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset, main_#t~ret396#1.base, main_#t~ret396#1.offset, main_#t~nondet397#1, main_#t~switch398#1, main_#t~nondet399#1, main_#t~switch400#1, main_#t~ret401#1, main_#t~nondet402#1, main_#t~switch403#1, main_#t~ret404#1, main_#t~nondet405#1, main_#t~switch406#1, main_#t~ret407#1, main_#t~ret408#1, main_#t~ret409#1, main_#t~ret410#1, main_#t~ret411#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~31#1.base, main_~tmp~31#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~tmp___1~7#1, main_~tmp___2~4#1, main_~tmp___3~1#1, main_~tmp___4~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~31#1.base, main_~tmp~31#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~tmp___1~7#1;havoc main_~tmp___2~4#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,704 INFO L272 TraceCheckUtils]: 2: Hoare triple {37060#(= ~dev_counter~0 0)} call main_#t~ret395#1.base, main_#t~ret395#1.offset := ldv_zalloc(32); {37073#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:45,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {37073#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {37058#true} is VALID [2022-02-20 21:51:45,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {37058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {37058#true} is VALID [2022-02-20 21:51:45,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 21:51:45,706 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37058#true} {37060#(= ~dev_counter~0 0)} #1608#return; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {37060#(= ~dev_counter~0 0)} main_~tmp~31#1.base, main_~tmp~31#1.offset := main_#t~ret395#1.base, main_#t~ret395#1.offset;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~31#1.base, main_~tmp~31#1.offset; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,707 INFO L272 TraceCheckUtils]: 8: Hoare triple {37060#(= ~dev_counter~0 0)} call main_#t~ret396#1.base, main_#t~ret396#1.offset := ldv_zalloc(240); {37073#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:45,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {37073#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {37058#true} is VALID [2022-02-20 21:51:45,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {37058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {37058#true} is VALID [2022-02-20 21:51:45,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 21:51:45,708 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37058#true} {37060#(= ~dev_counter~0 0)} #1610#return; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {37060#(= ~dev_counter~0 0)} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret396#1.base, main_#t~ret396#1.offset;havoc main_#t~ret396#1.base, main_#t~ret396#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;assume { :begin_inline_ldv_initialize } true; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {37060#(= ~dev_counter~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {37060#(= ~dev_counter~0 0)} assume -2147483648 <= main_#t~nondet397#1 && main_#t~nondet397#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet397#1;havoc main_#t~nondet397#1;main_#t~switch398#1 := 0 == main_~tmp___1~7#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {37060#(= ~dev_counter~0 0)} assume !main_#t~switch398#1;main_#t~switch398#1 := main_#t~switch398#1 || 1 == main_~tmp___1~7#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {37060#(= ~dev_counter~0 0)} assume main_#t~switch398#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {37060#(= ~dev_counter~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet402#1 && main_#t~nondet402#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet402#1;havoc main_#t~nondet402#1;main_#t~switch403#1 := 0 == main_~tmp___3~1#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {37060#(= ~dev_counter~0 0)} assume !main_#t~switch403#1;main_#t~switch403#1 := main_#t~switch403#1 || 1 == main_~tmp___3~1#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {37060#(= ~dev_counter~0 0)} assume main_#t~switch403#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {37060#(= ~dev_counter~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ems_usb_driver_init } true;havoc ems_usb_driver_init_#res#1;havoc ems_usb_driver_init_#t~ret392#1, ems_usb_driver_init_~tmp~28#1;havoc ems_usb_driver_init_~tmp~28#1;assume { :begin_inline_ldv_usb_register_driver_23 } true;ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset := ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 32, 0;havoc ldv_usb_register_driver_23_#res#1;havoc ldv_usb_register_driver_23_#t~ret422#1, ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset, ldv_usb_register_driver_23_~ldv_func_res~0#1, ldv_usb_register_driver_23_~tmp~42#1;ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_23_~ldv_func_res~0#1;havoc ldv_usb_register_driver_23_~tmp~42#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet449#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet449#1 && usb_register_driver_#t~nondet449#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet449#1;havoc usb_register_driver_#t~nondet449#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {37060#(= ~dev_counter~0 0)} ldv_usb_register_driver_23_#t~ret422#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_23_#t~ret422#1 && ldv_usb_register_driver_23_#t~ret422#1 <= 2147483647;ldv_usb_register_driver_23_~tmp~42#1 := ldv_usb_register_driver_23_#t~ret422#1;havoc ldv_usb_register_driver_23_#t~ret422#1;ldv_usb_register_driver_23_~ldv_func_res~0#1 := ldv_usb_register_driver_23_~tmp~42#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset, ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset;havoc ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,712 INFO L272 TraceCheckUtils]: 23: Hoare triple {37060#(= ~dev_counter~0 0)} call ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset := ldv_zalloc(1520); {37073#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:45,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {37073#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {37058#true} is VALID [2022-02-20 21:51:45,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {37058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {37058#true} is VALID [2022-02-20 21:51:45,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {37058#true} assume true; {37058#true} is VALID [2022-02-20 21:51:45,714 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37058#true} {37060#(= ~dev_counter~0 0)} #1648#return; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {37060#(= ~dev_counter~0 0)} ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset := ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {37060#(= ~dev_counter~0 0)} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_23_#res#1 := ldv_usb_register_driver_23_~ldv_func_res~0#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {37060#(= ~dev_counter~0 0)} ems_usb_driver_init_#t~ret392#1 := ldv_usb_register_driver_23_#res#1;assume { :end_inline_ldv_usb_register_driver_23 } true;assume -2147483648 <= ems_usb_driver_init_#t~ret392#1 && ems_usb_driver_init_#t~ret392#1 <= 2147483647;ems_usb_driver_init_~tmp~28#1 := ems_usb_driver_init_#t~ret392#1;havoc ems_usb_driver_init_#t~ret392#1;ems_usb_driver_init_#res#1 := ems_usb_driver_init_~tmp~28#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {37060#(= ~dev_counter~0 0)} main_#t~ret404#1 := ems_usb_driver_init_#res#1;assume { :end_inline_ems_usb_driver_init } true;assume -2147483648 <= main_#t~ret404#1 && main_#t~ret404#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret404#1;havoc main_#t~ret404#1; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {37060#(= ~dev_counter~0 0)} assume !(0 == ~ldv_retval_1~0); {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {37060#(= ~dev_counter~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {37060#(= ~dev_counter~0 0)} assume { :begin_inline_ldv_check_final_state } true; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {37060#(= ~dev_counter~0 0)} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {37060#(= ~dev_counter~0 0)} assume 0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {37060#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:51:45,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {37060#(= ~dev_counter~0 0)} assume !(0 == ~dev_counter~0); {37059#false} is VALID [2022-02-20 21:51:45,718 INFO L272 TraceCheckUtils]: 38: Hoare triple {37059#false} call ldv_error(); {37059#false} is VALID [2022-02-20 21:51:45,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {37059#false} assume !false; {37059#false} is VALID [2022-02-20 21:51:45,718 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:51:45,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:51:45,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246811293] [2022-02-20 21:51:45,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246811293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:51:45,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:51:45,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:51:45,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980386918] [2022-02-20 21:51:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:51:45,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-02-20 21:51:45,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:51:45,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:45,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:45,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:51:45,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:51:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:51:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:51:45,757 INFO L87 Difference]: Start difference. First operand 2651 states and 3649 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:50,878 INFO L93 Difference]: Finished difference Result 2849 states and 3984 transitions. [2022-02-20 21:51:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:51:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-02-20 21:51:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:51:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1012 transitions. [2022-02-20 21:51:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1012 transitions. [2022-02-20 21:51:50,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1012 transitions. [2022-02-20 21:51:51,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1012 edges. 1012 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:52,145 INFO L225 Difference]: With dead ends: 2849 [2022-02-20 21:51:52,146 INFO L226 Difference]: Without dead ends: 2846 [2022-02-20 21:51:52,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:51:52,148 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 1054 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:51:52,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 1204 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 21:51:52,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2022-02-20 21:51:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2650. [2022-02-20 21:51:52,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:51:52,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2846 states. Second operand has 2650 states, 1952 states have (on average 1.3155737704918034) internal successors, (2568), 2014 states have internal predecessors, (2568), 503 states have call successors, (503), 181 states have call predecessors, (503), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:52,242 INFO L74 IsIncluded]: Start isIncluded. First operand 2846 states. Second operand has 2650 states, 1952 states have (on average 1.3155737704918034) internal successors, (2568), 2014 states have internal predecessors, (2568), 503 states have call successors, (503), 181 states have call predecessors, (503), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:52,246 INFO L87 Difference]: Start difference. First operand 2846 states. Second operand has 2650 states, 1952 states have (on average 1.3155737704918034) internal successors, (2568), 2014 states have internal predecessors, (2568), 503 states have call successors, (503), 181 states have call predecessors, (503), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:52,534 INFO L93 Difference]: Finished difference Result 2846 states and 3981 transitions. [2022-02-20 21:51:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3981 transitions. [2022-02-20 21:51:52,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:52,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:52,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 2650 states, 1952 states have (on average 1.3155737704918034) internal successors, (2568), 2014 states have internal predecessors, (2568), 503 states have call successors, (503), 181 states have call predecessors, (503), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) Second operand 2846 states. [2022-02-20 21:51:52,551 INFO L87 Difference]: Start difference. First operand has 2650 states, 1952 states have (on average 1.3155737704918034) internal successors, (2568), 2014 states have internal predecessors, (2568), 503 states have call successors, (503), 181 states have call predecessors, (503), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) Second operand 2846 states. [2022-02-20 21:51:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:52,841 INFO L93 Difference]: Finished difference Result 2846 states and 3981 transitions. [2022-02-20 21:51:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3981 transitions. [2022-02-20 21:51:52,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:51:52,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:51:52,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:51:52,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:51:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 1952 states have (on average 1.3155737704918034) internal successors, (2568), 2014 states have internal predecessors, (2568), 503 states have call successors, (503), 181 states have call predecessors, (503), 194 states have return successors, (576), 488 states have call predecessors, (576), 500 states have call successors, (576) [2022-02-20 21:51:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3647 transitions. [2022-02-20 21:51:53,331 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3647 transitions. Word has length 40 [2022-02-20 21:51:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:51:53,332 INFO L470 AbstractCegarLoop]: Abstraction has 2650 states and 3647 transitions. [2022-02-20 21:51:53,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3647 transitions. [2022-02-20 21:51:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 21:51:53,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:51:53,333 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] [2022-02-20 21:51:53,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:51:53,334 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:51:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:51:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1239251357, now seen corresponding path program 1 times [2022-02-20 21:51:53,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:51:53,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105681776] [2022-02-20 21:51:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:51:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:51:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:51:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:53,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {50489#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {50474#true} is VALID [2022-02-20 21:51:53,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {50474#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {50474#true} is VALID [2022-02-20 21:51:53,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {50474#true} assume true; {50474#true} is VALID [2022-02-20 21:51:53,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50474#true} {50476#(= ~INTERF_STATE~0 0)} #1608#return; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:51:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:53,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {50489#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {50474#true} is VALID [2022-02-20 21:51:53,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {50474#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {50474#true} is VALID [2022-02-20 21:51:53,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {50474#true} assume true; {50474#true} is VALID [2022-02-20 21:51:53,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50474#true} {50476#(= ~INTERF_STATE~0 0)} #1610#return; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:51:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:51:53,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {50489#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {50474#true} is VALID [2022-02-20 21:51:53,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {50474#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {50474#true} is VALID [2022-02-20 21:51:53,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {50474#true} assume true; {50474#true} is VALID [2022-02-20 21:51:53,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50474#true} {50476#(= ~INTERF_STATE~0 0)} #1648#return; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {50474#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(86, 2);call #Ultimate.allocInit(14, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(26, 5);call #Ultimate.allocInit(63, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(14, 10);call #Ultimate.allocInit(39, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(25, 13);call #Ultimate.allocInit(31, 14);call #Ultimate.allocInit(26, 15);call #Ultimate.allocInit(28, 16);call #Ultimate.allocInit(28, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(25, 20);call #Ultimate.allocInit(31, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(18, 23);call #Ultimate.allocInit(21, 24);call #Ultimate.allocInit(22, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(32, 27);call #Ultimate.allocInit(25, 28);call #Ultimate.allocInit(36, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(8, 31);call #Ultimate.allocInit(8, 32);~LDV_IN_INTERRUPT~0 := 1;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ems_usb_netdev_ops_group1~0.base, ~ems_usb_netdev_ops_group1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ldv_state_variable_0~0 := 0;~#ems_usb_table~0.base, ~#ems_usb_table~0.offset := 33, 0;call #Ultimate.allocInit(50, 33);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#ems_usb_table~0.base);call write~unchecked~int(3, ~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, 2);call write~unchecked~int(4822, ~#ems_usb_table~0.base, 2 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(1092, ~#ems_usb_table~0.base, 4 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 6 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 8 + ~#ems_usb_table~0.offset, 2);call write~unchecked~int(0, ~#ems_usb_table~0.base, 10 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 11 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 12 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 13 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 14 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 15 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 16 + ~#ems_usb_table~0.offset, 1);call write~unchecked~int(0, ~#ems_usb_table~0.base, 17 + ~#ems_usb_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset := 34, 0;call #Ultimate.allocInit(448, 34);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 8 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_open.base, #funAddr~ems_usb_open.offset, ~#ems_usb_netdev_ops~0.base, 16 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_close.base, #funAddr~ems_usb_close.offset, ~#ems_usb_netdev_ops~0.base, 24 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_start_xmit.base, #funAddr~ems_usb_start_xmit.offset, ~#ems_usb_netdev_ops~0.base, 32 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 40 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 48 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 56 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 64 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 72 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 80 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 88 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 96 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 104 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 112 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 120 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 128 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 136 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 144 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 152 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 160 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 168 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 176 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 184 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 192 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 200 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 208 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 216 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 224 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 232 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 240 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 248 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 256 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 264 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 272 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 280 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 288 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 296 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 304 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 312 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 320 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 328 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 336 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 344 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 352 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 360 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 368 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 376 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 384 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 392 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 400 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 408 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 416 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 424 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 432 + ~#ems_usb_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_netdev_ops~0.base, 440 + ~#ems_usb_netdev_ops~0.offset, 8);~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset := 35, 0;call #Ultimate.allocInit(48, 35);call write~init~int(101, ~#ems_usb_bittiming_const~0.base, ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(109, ~#ems_usb_bittiming_const~0.base, 1 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 2 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(95, ~#ems_usb_bittiming_const~0.base, 3 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(117, ~#ems_usb_bittiming_const~0.base, 4 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(115, ~#ems_usb_bittiming_const~0.base, 5 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(98, ~#ems_usb_bittiming_const~0.base, 6 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 7 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 8 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 9 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 10 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 11 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 12 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 13 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 14 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(0, ~#ems_usb_bittiming_const~0.base, 15 + ~#ems_usb_bittiming_const~0.offset, 1);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 16 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(16, ~#ems_usb_bittiming_const~0.base, 20 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 24 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(8, ~#ems_usb_bittiming_const~0.base, 28 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(4, ~#ems_usb_bittiming_const~0.base, 32 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 36 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(64, ~#ems_usb_bittiming_const~0.base, 40 + ~#ems_usb_bittiming_const~0.offset, 4);call write~init~int(1, ~#ems_usb_bittiming_const~0.base, 44 + ~#ems_usb_bittiming_const~0.offset, 4);~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset := 36, 0;call #Ultimate.allocInit(285, 36);call write~init~$Pointer$(31, 0, ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_probe.base, #funAddr~ems_usb_probe.offset, ~#ems_usb_driver~0.base, 8 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ems_usb_disconnect.base, #funAddr~ems_usb_disconnect.offset, ~#ems_usb_driver~0.base, 16 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 24 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 32 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 40 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 48 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 56 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 64 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(~#ems_usb_table~0.base, ~#ems_usb_table~0.offset, ~#ems_usb_driver~0.base, 72 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 80 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 84 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 88 + ~#ems_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 92 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 100 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 108 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 116 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 124 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 132 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 136 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 148 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 156 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 164 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 172 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 180 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 188 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 196 + ~#ems_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 197 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 205 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 213 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 221 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 229 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 237 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 245 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 253 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 261 + ~#ems_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ems_usb_driver~0.base, 269 + ~#ems_usb_driver~0.offset, 8);call write~init~int(0, ~#ems_usb_driver~0.base, 277 + ~#ems_usb_driver~0.offset, 4);call write~init~int(0, ~#ems_usb_driver~0.base, 281 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 282 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 283 + ~#ems_usb_driver~0.offset, 1);call write~init~int(0, ~#ems_usb_driver~0.base, 284 + ~#ems_usb_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset, main_#t~ret396#1.base, main_#t~ret396#1.offset, main_#t~nondet397#1, main_#t~switch398#1, main_#t~nondet399#1, main_#t~switch400#1, main_#t~ret401#1, main_#t~nondet402#1, main_#t~switch403#1, main_#t~ret404#1, main_#t~nondet405#1, main_#t~switch406#1, main_#t~ret407#1, main_#t~ret408#1, main_#t~ret409#1, main_#t~ret410#1, main_#t~ret411#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~31#1.base, main_~tmp~31#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~tmp___1~7#1, main_~tmp___2~4#1, main_~tmp___3~1#1, main_~tmp___4~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~31#1.base, main_~tmp~31#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~tmp___1~7#1;havoc main_~tmp___2~4#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,489 INFO L272 TraceCheckUtils]: 2: Hoare triple {50476#(= ~INTERF_STATE~0 0)} call main_#t~ret395#1.base, main_#t~ret395#1.offset := ldv_zalloc(32); {50489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:53,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {50489#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {50474#true} is VALID [2022-02-20 21:51:53,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {50474#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {50474#true} is VALID [2022-02-20 21:51:53,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {50474#true} assume true; {50474#true} is VALID [2022-02-20 21:51:53,490 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {50474#true} {50476#(= ~INTERF_STATE~0 0)} #1608#return; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {50476#(= ~INTERF_STATE~0 0)} main_~tmp~31#1.base, main_~tmp~31#1.offset := main_#t~ret395#1.base, main_#t~ret395#1.offset;havoc main_#t~ret395#1.base, main_#t~ret395#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~31#1.base, main_~tmp~31#1.offset; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,491 INFO L272 TraceCheckUtils]: 8: Hoare triple {50476#(= ~INTERF_STATE~0 0)} call main_#t~ret396#1.base, main_#t~ret396#1.offset := ldv_zalloc(240); {50489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:53,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {50489#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {50474#true} is VALID [2022-02-20 21:51:53,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {50474#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {50474#true} is VALID [2022-02-20 21:51:53,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {50474#true} assume true; {50474#true} is VALID [2022-02-20 21:51:53,492 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {50474#true} {50476#(= ~INTERF_STATE~0 0)} #1610#return; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {50476#(= ~INTERF_STATE~0 0)} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret396#1.base, main_#t~ret396#1.offset;havoc main_#t~ret396#1.base, main_#t~ret396#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;assume { :begin_inline_ldv_initialize } true; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume -2147483648 <= main_#t~nondet397#1 && main_#t~nondet397#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet397#1;havoc main_#t~nondet397#1;main_#t~switch398#1 := 0 == main_~tmp___1~7#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume !main_#t~switch398#1;main_#t~switch398#1 := main_#t~switch398#1 || 1 == main_~tmp___1~7#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume main_#t~switch398#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet402#1 && main_#t~nondet402#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet402#1;havoc main_#t~nondet402#1;main_#t~switch403#1 := 0 == main_~tmp___3~1#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume !main_#t~switch403#1;main_#t~switch403#1 := main_#t~switch403#1 || 1 == main_~tmp___3~1#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume main_#t~switch403#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ems_usb_driver_init } true;havoc ems_usb_driver_init_#res#1;havoc ems_usb_driver_init_#t~ret392#1, ems_usb_driver_init_~tmp~28#1;havoc ems_usb_driver_init_~tmp~28#1;assume { :begin_inline_ldv_usb_register_driver_23 } true;ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset := ~#ems_usb_driver~0.base, ~#ems_usb_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 32, 0;havoc ldv_usb_register_driver_23_#res#1;havoc ldv_usb_register_driver_23_#t~ret422#1, ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset, ldv_usb_register_driver_23_~ldv_func_res~0#1, ldv_usb_register_driver_23_~tmp~42#1;ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset := ldv_usb_register_driver_23_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_23_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_23_~ldv_func_res~0#1;havoc ldv_usb_register_driver_23_~tmp~42#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_23_~ldv_func_arg1#1.base, ldv_usb_register_driver_23_~ldv_func_arg1#1.offset, ldv_usb_register_driver_23_~ldv_func_arg2#1.base, ldv_usb_register_driver_23_~ldv_func_arg2#1.offset, ldv_usb_register_driver_23_~ldv_func_arg3#1.base, ldv_usb_register_driver_23_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet449#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet449#1 && usb_register_driver_#t~nondet449#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet449#1;havoc usb_register_driver_#t~nondet449#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {50476#(= ~INTERF_STATE~0 0)} ldv_usb_register_driver_23_#t~ret422#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_23_#t~ret422#1 && ldv_usb_register_driver_23_#t~ret422#1 <= 2147483647;ldv_usb_register_driver_23_~tmp~42#1 := ldv_usb_register_driver_23_#t~ret422#1;havoc ldv_usb_register_driver_23_#t~ret422#1;ldv_usb_register_driver_23_~ldv_func_res~0#1 := ldv_usb_register_driver_23_~tmp~42#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset, ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset;havoc ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,498 INFO L272 TraceCheckUtils]: 23: Hoare triple {50476#(= ~INTERF_STATE~0 0)} call ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset := ldv_zalloc(1520); {50489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:51:53,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {50489#(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~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~1#1 := #t~nondet49#1;havoc #t~nondet49#1; {50474#true} is VALID [2022-02-20 21:51:53,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {50474#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {50474#true} is VALID [2022-02-20 21:51:53,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {50474#true} assume true; {50474#true} is VALID [2022-02-20 21:51:53,499 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {50474#true} {50476#(= ~INTERF_STATE~0 0)} #1648#return; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {50476#(= ~INTERF_STATE~0 0)} ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset := ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;havoc ldv_usb_driver_1_#t~ret393#1.base, ldv_usb_driver_1_#t~ret393#1.offset;~ems_usb_driver_group1~0.base, ~ems_usb_driver_group1~0.offset := ldv_usb_driver_1_~tmp~29#1.base, ldv_usb_driver_1_~tmp~29#1.offset; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_23_#res#1 := ldv_usb_register_driver_23_~ldv_func_res~0#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {50476#(= ~INTERF_STATE~0 0)} ems_usb_driver_init_#t~ret392#1 := ldv_usb_register_driver_23_#res#1;assume { :end_inline_ldv_usb_register_driver_23 } true;assume -2147483648 <= ems_usb_driver_init_#t~ret392#1 && ems_usb_driver_init_#t~ret392#1 <= 2147483647;ems_usb_driver_init_~tmp~28#1 := ems_usb_driver_init_#t~ret392#1;havoc ems_usb_driver_init_#t~ret392#1;ems_usb_driver_init_#res#1 := ems_usb_driver_init_~tmp~28#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {50476#(= ~INTERF_STATE~0 0)} main_#t~ret404#1 := ems_usb_driver_init_#res#1;assume { :end_inline_ems_usb_driver_init } true;assume -2147483648 <= main_#t~ret404#1 && main_#t~ret404#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret404#1;havoc main_#t~ret404#1; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume !(0 == ~ldv_retval_1~0); {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume { :begin_inline_ldv_check_final_state } true; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume 0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume 0 == ~dev_counter~0; {50476#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:51:53,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {50476#(= ~INTERF_STATE~0 0)} assume !(0 == ~INTERF_STATE~0); {50475#false} is VALID [2022-02-20 21:51:53,509 INFO L272 TraceCheckUtils]: 39: Hoare triple {50475#false} call ldv_error(); {50475#false} is VALID [2022-02-20 21:51:53,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {50475#false} assume !false; {50475#false} is VALID [2022-02-20 21:51:53,510 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:51:53,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:51:53,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105681776] [2022-02-20 21:51:53,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105681776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:51:53,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:51:53,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:51:53,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269953090] [2022-02-20 21:51:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:51:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-20 21:51:53,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:51:53,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:53,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:53,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:51:53,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:51:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:51:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:51:53,561 INFO L87 Difference]: Start difference. First operand 2650 states and 3647 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:51:58,377 INFO L93 Difference]: Finished difference Result 2848 states and 3982 transitions. [2022-02-20 21:51:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:51:58,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-20 21:51:58,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:51:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2022-02-20 21:51:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:51:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2022-02-20 21:51:58,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1010 transitions. [2022-02-20 21:51:59,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1010 edges. 1010 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:51:59,556 INFO L225 Difference]: With dead ends: 2848 [2022-02-20 21:51:59,556 INFO L226 Difference]: Without dead ends: 2845 [2022-02-20 21:51:59,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:51:59,557 INFO L933 BasicCegarLoop]: 838 mSDtfsCounter, 1051 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:51:59,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 1201 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 21:51:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states.