/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:35:24,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:35:24,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:35:24,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:35:24,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:35:24,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:35:24,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:35:24,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:35:24,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:35:24,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:35:24,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:35:24,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:35:24,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:35:24,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:35:24,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:35:24,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:35:24,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:35:24,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:35:24,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:35:24,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:35:24,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:35:24,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:35:24,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:35:24,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:35:24,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:35:24,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:35:24,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:35:24,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:35:24,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:35:24,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:35:24,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:35:24,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:35:24,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:35:24,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:35:24,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:35:24,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:35:24,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:35:24,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:35:24,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:35:24,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:35:24,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:35:24,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:35:25,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:35:25,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:35:25,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:35:25,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:35:25,026 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:35:25,026 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:35:25,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:35:25,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:35:25,028 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:35:25,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:35:25,028 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:35:25,028 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:35:25,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:35:25,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:35:25,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:35:25,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:35:25,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:35:25,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:35:25,030 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:35:25,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:35:25,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:35:25,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:35:25,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:35:25,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:35:25,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:35:25,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:35:25,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:35:25,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:35:25,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:35:25,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:35:25,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:35:25,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:35:25,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:35:25,033 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 [2022-10-15 21:35:25,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:35:25,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:35:25,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:35:25,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:35:25,491 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:35:25,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:25,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b50edeaa/5c92ba7367a248868eacf472aeb35b45/FLAG626f63dfc [2022-10-15 21:35:26,645 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:35:26,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:26,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b50edeaa/5c92ba7367a248868eacf472aeb35b45/FLAG626f63dfc [2022-10-15 21:35:26,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b50edeaa/5c92ba7367a248868eacf472aeb35b45 [2022-10-15 21:35:26,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:35:26,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:35:26,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:35:26,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:35:26,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:35:26,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:35:26" (1/1) ... [2022-10-15 21:35:26,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9c7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:26, skipping insertion in model container [2022-10-15 21:35:26,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:35:26" (1/1) ... [2022-10-15 21:35:26,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:35:26,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:35:27,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-10-15 21:35:27,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:35:27,800 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:35:28,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-10-15 21:35:28,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:35:28,152 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:35:28,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28 WrapperNode [2022-10-15 21:35:28,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:35:28,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:35:28,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:35:28,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:35:28,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,355 INFO L138 Inliner]: procedures = 107, calls = 312, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 779 [2022-10-15 21:35:28,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:35:28,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:35:28,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:35:28,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:35:28,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,492 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:35:28,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:35:28,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:35:28,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:35:28,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (1/1) ... [2022-10-15 21:35:28,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:35:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:35:28,559 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-10-15 21:35:28,564 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-10-15 21:35:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:35:28,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:35:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:35:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-15 21:35:28,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-15 21:35:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:35:28,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:35:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:35:28,631 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:35:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-10-15 21:35:28,631 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-10-15 21:35:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:35:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:35:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:35:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-15 21:35:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-15 21:35:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-10-15 21:35:28,633 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-10-15 21:35:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-10-15 21:35:28,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-10-15 21:35:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:35:28,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:35:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:35:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:35:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-10-15 21:35:28,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-10-15 21:35:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:35:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-10-15 21:35:28,635 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-10-15 21:35:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-10-15 21:35:28,635 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-10-15 21:35:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-10-15 21:35:28,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-10-15 21:35:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:35:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:35:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:35:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-10-15 21:35:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-10-15 21:35:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-10-15 21:35:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-10-15 21:35:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:35:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:35:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:35:29,029 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:35:29,033 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:35:29,139 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:35:30,130 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:35:30,149 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:35:30,149 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:35:30,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:35:30 BoogieIcfgContainer [2022-10-15 21:35:30,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:35:30,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:35:30,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:35:30,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:35:30,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:35:26" (1/3) ... [2022-10-15 21:35:30,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31acc3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:35:30, skipping insertion in model container [2022-10-15 21:35:30,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:28" (2/3) ... [2022-10-15 21:35:30,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31acc3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:35:30, skipping insertion in model container [2022-10-15 21:35:30,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:35:30" (3/3) ... [2022-10-15 21:35:30,170 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:30,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:35:30,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 21:35:30,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:35:30,324 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d6e197c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:35:30,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 21:35:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 250 states, 183 states have (on average 1.349726775956284) internal successors, (247), 202 states have internal predecessors, (247), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-10-15 21:35:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:35:30,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:30,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:30,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:35:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1197197438, now seen corresponding path program 1 times [2022-10-15 21:35:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:30,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450800238] [2022-10-15 21:35:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 21:35:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:35:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:31,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450800238] [2022-10-15 21:35:31,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450800238] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:31,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:31,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324030182] [2022-10-15 21:35:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:31,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:35:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:35:31,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:35:31,146 INFO L87 Difference]: Start difference. First operand has 250 states, 183 states have (on average 1.349726775956284) internal successors, (247), 202 states have internal predecessors, (247), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:35:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:31,655 INFO L93 Difference]: Finished difference Result 502 states and 674 transitions. [2022-10-15 21:35:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:35:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-10-15 21:35:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:31,675 INFO L225 Difference]: With dead ends: 502 [2022-10-15 21:35:31,675 INFO L226 Difference]: Without dead ends: 231 [2022-10-15 21:35:31,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10-15 21:35:31,687 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 120 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:31,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 692 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-10-15 21:35:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-10-15 21:35:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 168 states have (on average 1.2976190476190477) internal successors, (218), 177 states have internal predecessors, (218), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-10-15 21:35:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2022-10-15 21:35:31,767 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 38 [2022-10-15 21:35:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:31,768 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2022-10-15 21:35:31,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:35:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2022-10-15 21:35:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:35:31,771 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:31,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:35:31,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:35:31,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:35:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash 726030596, now seen corresponding path program 1 times [2022-10-15 21:35:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837682722] [2022-10-15 21:35:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 21:35:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:35:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:31,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837682722] [2022-10-15 21:35:31,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837682722] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:31,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:31,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639116429] [2022-10-15 21:35:31,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:31,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:31,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:31,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:31,977 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:35:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:32,501 INFO L93 Difference]: Finished difference Result 478 states and 611 transitions. [2022-10-15 21:35:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-10-15 21:35:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:32,505 INFO L225 Difference]: With dead ends: 478 [2022-10-15 21:35:32,506 INFO L226 Difference]: Without dead ends: 259 [2022-10-15 21:35:32,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:32,509 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 156 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:32,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 801 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-10-15 21:35:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2022-10-15 21:35:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 199 states have internal predecessors, (246), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-15 21:35:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 318 transitions. [2022-10-15 21:35:32,540 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 318 transitions. Word has length 38 [2022-10-15 21:35:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:32,540 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 318 transitions. [2022-10-15 21:35:32,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:35:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 318 transitions. [2022-10-15 21:35:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-15 21:35:32,544 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:32,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:32,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:35:32,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:35:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -638513474, now seen corresponding path program 1 times [2022-10-15 21:35:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:32,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824092189] [2022-10-15 21:35:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:32,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:35:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:35:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824092189] [2022-10-15 21:35:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824092189] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:32,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:32,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682571525] [2022-10-15 21:35:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:32,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:32,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:32,845 INFO L87 Difference]: Start difference. First operand 251 states and 318 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:35:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:33,593 INFO L93 Difference]: Finished difference Result 497 states and 639 transitions. [2022-10-15 21:35:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2022-10-15 21:35:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:33,599 INFO L225 Difference]: With dead ends: 497 [2022-10-15 21:35:33,599 INFO L226 Difference]: Without dead ends: 493 [2022-10-15 21:35:33,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:33,605 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 299 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:33,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 976 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:35:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-10-15 21:35:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 475. [2022-10-15 21:35:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 367 states have (on average 1.2942779291553133) internal successors, (475), 378 states have internal predecessors, (475), 69 states have call successors, (69), 31 states have call predecessors, (69), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-10-15 21:35:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 613 transitions. [2022-10-15 21:35:33,690 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 613 transitions. Word has length 70 [2022-10-15 21:35:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:33,694 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 613 transitions. [2022-10-15 21:35:33,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:35:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 613 transitions. [2022-10-15 21:35:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-15 21:35:33,704 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:33,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:33,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:35:33,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:35:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash -860692922, now seen corresponding path program 1 times [2022-10-15 21:35:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:33,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944926946] [2022-10-15 21:35:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:35:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:35:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:34,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944926946] [2022-10-15 21:35:34,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944926946] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:34,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:34,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 21:35:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120405272] [2022-10-15 21:35:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:34,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:35:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:35:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:34,105 INFO L87 Difference]: Start difference. First operand 475 states and 613 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 21:35:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:34,787 INFO L93 Difference]: Finished difference Result 1283 states and 1707 transitions. [2022-10-15 21:35:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:34,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 73 [2022-10-15 21:35:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:34,795 INFO L225 Difference]: With dead ends: 1283 [2022-10-15 21:35:34,795 INFO L226 Difference]: Without dead ends: 827 [2022-10-15 21:35:34,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:35:34,799 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 380 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:34,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1824 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:35:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-10-15 21:35:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 481. [2022-10-15 21:35:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 373 states have (on average 1.289544235924933) internal successors, (481), 384 states have internal predecessors, (481), 69 states have call successors, (69), 31 states have call predecessors, (69), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-10-15 21:35:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 619 transitions. [2022-10-15 21:35:34,853 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 619 transitions. Word has length 73 [2022-10-15 21:35:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:34,854 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 619 transitions. [2022-10-15 21:35:34,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 21:35:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 619 transitions. [2022-10-15 21:35:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-15 21:35:34,856 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:34,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:34,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:35:34,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:35:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1222874879, now seen corresponding path program 1 times [2022-10-15 21:35:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:34,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107382662] [2022-10-15 21:35:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:35:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:35:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:35,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107382662] [2022-10-15 21:35:35,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107382662] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:35,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:35,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 21:35:35,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158756389] [2022-10-15 21:35:35,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:35,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:35:35,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:35,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:35:35,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:35,613 INFO L87 Difference]: Start difference. First operand 481 states and 619 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 21:35:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:36,107 INFO L93 Difference]: Finished difference Result 961 states and 1245 transitions. [2022-10-15 21:35:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:35:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 75 [2022-10-15 21:35:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:36,113 INFO L225 Difference]: With dead ends: 961 [2022-10-15 21:35:36,116 INFO L226 Difference]: Without dead ends: 495 [2022-10-15 21:35:36,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:36,123 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 117 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:36,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1218 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-10-15 21:35:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 485. [2022-10-15 21:35:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 375 states have (on average 1.288) internal successors, (483), 388 states have internal predecessors, (483), 69 states have call successors, (69), 31 states have call predecessors, (69), 33 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2022-10-15 21:35:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 627 transitions. [2022-10-15 21:35:36,197 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 627 transitions. Word has length 75 [2022-10-15 21:35:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:36,197 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 627 transitions. [2022-10-15 21:35:36,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 21:35:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 627 transitions. [2022-10-15 21:35:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-15 21:35:36,203 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:36,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:36,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:35:36,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:35:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 378155187, now seen corresponding path program 1 times [2022-10-15 21:35:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80165433] [2022-10-15 21:35:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:35:36,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:35:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:35:36,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:35:36,737 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:35:36,739 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-10-15 21:35:36,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-10-15 21:35:36,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-10-15 21:35:36,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-10-15 21:35:36,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-10-15 21:35:36,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-10-15 21:35:36,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-10-15 21:35:36,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-10-15 21:35:36,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:35:36,751 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-10-15 21:35:36,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:35:37,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:35:37 BoogieIcfgContainer [2022-10-15 21:35:37,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:35:37,015 INFO L158 Benchmark]: Toolchain (without parser) took 10283.63ms. Allocated memory was 155.2MB in the beginning and 275.8MB in the end (delta: 120.6MB). Free memory was 125.3MB in the beginning and 158.9MB in the end (delta: -33.6MB). Peak memory consumption was 87.6MB. Max. memory is 8.0GB. [2022-10-15 21:35:37,016 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 125.6MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:35:37,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1413.36ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 87.9MB in the end (delta: 37.2MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. [2022-10-15 21:35:37,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.73ms. Allocated memory is still 155.2MB. Free memory was 87.9MB in the beginning and 81.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:37,017 INFO L158 Benchmark]: Boogie Preprocessor took 154.60ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 75.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:37,018 INFO L158 Benchmark]: RCFGBuilder took 1641.46ms. Allocated memory was 155.2MB in the beginning and 229.6MB in the end (delta: 74.4MB). Free memory was 75.3MB in the beginning and 172.0MB in the end (delta: -96.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:37,018 INFO L158 Benchmark]: TraceAbstraction took 6854.42ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 171.4MB in the beginning and 158.9MB in the end (delta: 12.6MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. [2022-10-15 21:35:37,021 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 125.6MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1413.36ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 87.9MB in the end (delta: 37.2MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 201.73ms. Allocated memory is still 155.2MB. Free memory was 87.9MB in the beginning and 81.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 154.60ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 75.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1641.46ms. Allocated memory was 155.2MB in the beginning and 229.6MB in the end (delta: 74.4MB). Free memory was 75.3MB in the beginning and 172.0MB in the end (delta: -96.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6854.42ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 171.4MB in the beginning and 158.9MB in the end (delta: 12.6MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 3380]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 3836, overapproximation of bitwiseAnd at line 3308. Possible FailurePath: [L3540] int LDV_IN_INTERRUPT = 1; [L3541] int ref_cnt ; [L3542] int ldv_state_variable_1 ; [L3543] int usb_counter ; [L3544] struct usb_interface *usb_acecad_driver_group1 ; [L3545] int ldv_state_variable_0 ; [L3829-L3833] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3834] struct usb_device_id const __mod_usb_device_table ; [L3835-L3840] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L3862] int ldv_retval_0 ; [L3863] int ldv_retval_1 ; [L4059] int INTERF_STATE = 0; [L4060] int SERIAL_STATE = 0; [L4061] void *usb_intfdata = (void *)0; [L4062] struct urb *usb_urb = (struct urb *)0; [L4063] struct usb_device *usb_dev = (struct usb_device *)0; [L4064] int dev_counter = 0; [L4065] int completeFnIntCounter = 0; [L4066] int completeFnBulkCounter = 0; [L4067] void (*completeFnInt)(struct urb * ) ; [L4068] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3877] struct usb_device_id *ldvarg0 ; [L3878] void *tmp ; [L3879] int tmp___0 ; [L3880] int tmp___1 ; [L3881] int tmp___2 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-4294967297:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-4294967297:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-4294967297:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-4294967297:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-4294967297:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-4294967297:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-4294967297:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-4294967297:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] RET, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-4294967297:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] tmp = ldv_init_zalloc(24UL) [L3884] ldvarg0 = (struct usb_device_id *)tmp [L3885] FCALL ldv_initialize() [L3886] ldv_state_variable_1 = 0 [L3887] ref_cnt = 0 [L3888] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: [L3934] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3935] COND TRUE ldv_state_variable_0 == 1 [L3936] CALL, EXPR usb_acecad_init() [L3843] int result ; [L3844] int tmp ; [L3846] CALL, EXPR usb_register(& usb_acecad_driver) [L3358] int tmp ; [L3360] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3977] ldv_func_ret_type ldv_func_res ; [L3978] int tmp ; [L3980] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4352] return __VERIFIER_nondet_int(); [L3980] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3980] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3981] ldv_func_res = tmp [L3982] ldv_state_variable_1 = 1 [L3983] usb_counter = 0 [L3984] CALL ldv_usb_driver_1() [L3868] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, calloc(1UL, size)={-8589934593:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, calloc(1UL, size)={-8589934593:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-8589934593:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, calloc(1UL, size)={-8589934593:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-8589934593:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \result={-8589934593:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, calloc(1UL, size)={-8589934593:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-8589934593:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] RET, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-8589934593:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] tmp = ldv_init_zalloc(1248UL) [L3871] usb_acecad_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-8589934593:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3984] RET ldv_usb_driver_1() [L3985] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={15:0}, ldv_func_arg1={15:0}, ldv_func_arg2={8388609:8388611}, ldv_func_arg2={8388609:8388611}, ldv_func_arg3={4:0}, ldv_func_arg3={4:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3360] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3360] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={15:0}, driver={15:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3846] RET, EXPR usb_register(& usb_acecad_driver) [L3846] tmp = usb_register(& usb_acecad_driver) [L3847] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3848] COND TRUE result == 0 [L3852] return (result); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3936] RET, EXPR usb_acecad_init() [L3936] ldv_retval_1 = usb_acecad_init() [L3937] COND TRUE ldv_retval_1 == 0 [L3938] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3941] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0=0, tmp___2=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3893] COND TRUE ldv_state_variable_1 != 0 [L3894] tmp___1 = __VERIFIER_nondet_int() [L3896] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3897] COND TRUE ldv_state_variable_1 == 1 [L3898] CALL usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3690] struct usb_device *dev ; [L3691] struct usb_device *tmp ; [L3692] struct usb_host_interface *interface ; [L3693] struct usb_endpoint_descriptor *endpoint ; [L3694] struct usb_acecad *acecad ; [L3695] struct input_dev *input_dev ; [L3696] int pipe ; [L3697] int maxp ; [L3698] int err ; [L3699] int tmp___0 ; [L3700] unsigned int tmp___1 ; [L3701] __u16 tmp___2 ; [L3702] void *tmp___3 ; [L3703] void *tmp___4 ; [L3704] size_t tmp___5 ; [L3705] size_t tmp___6 ; [L3707] CALL, EXPR interface_to_usbdev(intf) [L3968] struct usb_device *tmp ; [L3970] CALL, EXPR ldv_interface_to_usbdev() [L4172] void *result ; [L4173] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1070, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1070, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-12884901889:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-12884901889:0}, tmp___0=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1070, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-12884901889:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-12884901889:0}, tmp___0=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1070, \result={-12884901889:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-12884901889:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-12884901889:0}, tmp___0=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-12884901889:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] tmp = ldv_malloc(sizeof(struct usb_device)) [L4176] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-12884901889:0}, SERIAL_STATE=0, tmp={-12884901889:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4177] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-12884901889:0}, SERIAL_STATE=0, tmp={-12884901889:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4181] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-12884901889:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-12884901889:0}, SERIAL_STATE=0, tmp={-12884901889:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3970] RET, EXPR ldv_interface_to_usbdev() [L3970] tmp = ldv_interface_to_usbdev() [L3971] return (tmp); VAL [={0:0}, ={0:0}, \result={-12884901889:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, intf={-8589934593:0}, intf={-8589934593:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-12884901889:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3707] RET, EXPR interface_to_usbdev(intf) [L3707] tmp = interface_to_usbdev(intf) [L3708] dev = tmp [L3709] EXPR intf->cur_altsetting [L3709] interface = intf->cur_altsetting [L3710] EXPR interface->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-12884901889:0}, dev_counter=0, id={-4294967297:0}, id={-4294967297:0}, INTERF_STATE=0, interface={8388610:-11}, interface->desc.bNumEndpoints=257, intf={-8589934593:0}, intf={-8589934593:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-12884901889:0}, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3710] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3714] EXPR interface->endpoint [L3714] endpoint = & (interface->endpoint)->desc [L3715] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3313] int tmp ; [L3314] int tmp___0 ; [L3315] int tmp___1 ; [L3317] CALL, EXPR usb_endpoint_xfer_int(epd) [L3308] EXPR epd->bmAttributes [L3308] return (((int )epd->bmAttributes & 3) == 3); [L3317] RET, EXPR usb_endpoint_xfer_int(epd) [L3317] tmp = usb_endpoint_xfer_int(epd) [L3318] COND TRUE tmp != 0 [L3319] CALL, EXPR usb_endpoint_dir_in(epd) [L3302] EXPR epd->bEndpointAddress [L3302] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3319] RET, EXPR usb_endpoint_dir_in(epd) [L3319] tmp___0 = usb_endpoint_dir_in(epd) [L3320] COND TRUE tmp___0 != 0 [L3321] tmp___1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={8388612:0}, epd={8388612:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3328] return (tmp___1); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={8388612:0}, epd={8388612:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3715] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3715] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3716] COND FALSE !(tmp___0 == 0) [L3720] EXPR endpoint->bEndpointAddress [L3720] CALL __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3380] EXPR dev->devnum VAL [={0:0}, ={0:0}, \old(endpoint)=128, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-12884901889:0}, dev={-12884901889:0}, dev->devnum=8388608, dev_counter=0, endpoint=128, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3380] dev->devnum << 8 VAL [={0:0}, ={0:0}, \old(endpoint)=128, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388609:8388611}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-12884901889:0}, dev={-12884901889:0}, dev->devnum=8388608, dev_counter=0, endpoint=128, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={-8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 3380]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4123]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4123]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3901]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3901]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3911]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3911]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 251 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1118 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1072 mSDsluCounter, 5511 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3996 mSDsCounter, 541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1467 IncrementalHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 541 mSolverCounterUnsat, 1515 mSDtfsCounter, 1467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 389 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 21:35:37,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...