/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_1a-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:16,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:35:16,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:35:16,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:35:16,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:35:16,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:35:16,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:35:16,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:35:16,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:35:16,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:35:16,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:35:16,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:35:16,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:35:16,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:35:16,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:35:16,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:35:16,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:35:16,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:35:16,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:35:16,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:35:16,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:35:16,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:35:16,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:35:16,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:35:16,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:35:16,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:35:16,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:35:16,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:35:16,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:35:16,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:35:16,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:35:16,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:35:16,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:35:16,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:35:16,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:35:16,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:35:16,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:35:16,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:35:16,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:35:16,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:35:16,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:35:16,429 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:16,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:35:16,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:35:16,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:35:16,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:35:16,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:35:16,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:35:16,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:35:16,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:35:16,498 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:35:16,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:35:16,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:35:16,499 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:35:16,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:35:16,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:35:16,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:35:16,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:35:16,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:35:16,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:35:16,500 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:35:16,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:35:16,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:35:16,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:35:16,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:35:16,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:35:16,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:35:16,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:35:16,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:35:16,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:35:16,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:35:16,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:35:16,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:35:16,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:35:16,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:35:16,504 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:16,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:35:16,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:35:17,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:35:17,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:35:17,002 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:35:17,003 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:17,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba795c22d/dc3b6cccc32f4c959e78b3e49dae7180/FLAG9c33769f0 [2022-10-15 21:35:18,055 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:35:18,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:18,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba795c22d/dc3b6cccc32f4c959e78b3e49dae7180/FLAG9c33769f0 [2022-10-15 21:35:18,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba795c22d/dc3b6cccc32f4c959e78b3e49dae7180 [2022-10-15 21:35:18,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:35:18,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:35:18,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:35:18,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:35:18,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:35:18,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:35:18" (1/1) ... [2022-10-15 21:35:18,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d99a7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:18, skipping insertion in model container [2022-10-15 21:35:18,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:35:18" (1/1) ... [2022-10-15 21:35:18,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:35:18,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:35:19,732 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-10-15 21:35:19,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:35:19,823 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:35:20,071 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-10-15 21:35:20,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:35:20,132 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:35:20,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:20 WrapperNode [2022-10-15 21:35:20,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:35:20,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:35:20,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:35:20,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:35:20,150 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:20" (1/1) ... [2022-10-15 21:35:20,221 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:20" (1/1) ... [2022-10-15 21:35:20,309 INFO L138 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 791 [2022-10-15 21:35:20,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:35:20,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:35:20,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:35:20,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:35:20,324 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:20" (1/1) ... [2022-10-15 21:35:20,325 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:20" (1/1) ... [2022-10-15 21:35:20,356 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:20" (1/1) ... [2022-10-15 21:35:20,359 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:20" (1/1) ... [2022-10-15 21:35:20,418 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:20" (1/1) ... [2022-10-15 21:35:20,424 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:20" (1/1) ... [2022-10-15 21:35:20,432 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:20" (1/1) ... [2022-10-15 21:35:20,439 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:20" (1/1) ... [2022-10-15 21:35:20,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:35:20,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:35:20,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:35:20,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:35:20,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:20" (1/1) ... [2022-10-15 21:35:20,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:35:20,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:35:20,513 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:20,532 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:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:35:20,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:35:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:35:20,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-15 21:35:20,591 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-15 21:35:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:35:20,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:35:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:35:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:35:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-10-15 21:35:20,595 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-10-15 21:35:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:35:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:35:20,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:35:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-15 21:35:20,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-15 21:35:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-10-15 21:35:20,596 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-10-15 21:35:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-10-15 21:35:20,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-10-15 21:35:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:35:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:35:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:35:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:35:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-10-15 21:35:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-10-15 21:35:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:35:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-10-15 21:35:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-10-15 21:35:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-10-15 21:35:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-10-15 21:35:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-10-15 21:35:20,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-10-15 21:35:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:35:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:35:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:35:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-10-15 21:35:20,600 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-10-15 21:35:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-10-15 21:35:20,600 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-10-15 21:35:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:35:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:35:20,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:35:21,022 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:35:21,029 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:35:21,134 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:35:22,078 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:35:22,091 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:35:22,091 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:35:22,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:35:22 BoogieIcfgContainer [2022-10-15 21:35:22,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:35:22,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:35:22,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:35:22,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:35:22,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:35:18" (1/3) ... [2022-10-15 21:35:22,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e17562b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:35:22, skipping insertion in model container [2022-10-15 21:35:22,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:20" (2/3) ... [2022-10-15 21:35:22,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e17562b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:35:22, skipping insertion in model container [2022-10-15 21:35:22,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:35:22" (3/3) ... [2022-10-15 21:35:22,108 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:22,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:35:22,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-10-15 21:35:22,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:35:22,237 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;@57b15481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:35:22,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-10-15 21:35:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 187 states have (on average 1.358288770053476) internal successors, (254), 207 states have internal predecessors, (254), 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:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 21:35:22,258 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:22,259 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] [2022-10-15 21:35:22,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 740965027, now seen corresponding path program 1 times [2022-10-15 21:35:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:22,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870909435] [2022-10-15 21:35:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 21:35:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:22,966 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:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:22,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870909435] [2022-10-15 21:35:22,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870909435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:22,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:22,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:22,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798179500] [2022-10-15 21:35:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:22,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:35:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:35:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:35:23,019 INFO L87 Difference]: Start difference. First operand has 256 states, 187 states have (on average 1.358288770053476) internal successors, (254), 207 states have internal predecessors, (254), 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 5.8) internal successors, (29), 2 states have internal predecessors, (29), 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:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:23,470 INFO L93 Difference]: Finished difference Result 514 states and 690 transitions. [2022-10-15 21:35:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:35:23,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 2 states have internal predecessors, (29), 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 37 [2022-10-15 21:35:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:23,493 INFO L225 Difference]: With dead ends: 514 [2022-10-15 21:35:23,493 INFO L226 Difference]: Without dead ends: 239 [2022-10-15 21:35:23,500 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:23,505 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 97 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:23,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 700 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:35:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-10-15 21:35:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-10-15 21:35:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 184 states have internal predecessors, (227), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-10-15 21:35:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2022-10-15 21:35:23,630 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 37 [2022-10-15 21:35:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:23,631 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2022-10-15 21:35:23,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 2 states have internal predecessors, (29), 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:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2022-10-15 21:35:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 21:35:23,635 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:23,635 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] [2022-10-15 21:35:23,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:35:23,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash 803004641, now seen corresponding path program 1 times [2022-10-15 21:35:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:23,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152653733] [2022-10-15 21:35:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:23,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:23,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 21:35:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:23,837 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:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:23,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152653733] [2022-10-15 21:35:23,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152653733] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:23,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:23,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228286324] [2022-10-15 21:35:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:23,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:23,843 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:24,375 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2022-10-15 21:35:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:24,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 37 [2022-10-15 21:35:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:24,380 INFO L225 Difference]: With dead ends: 494 [2022-10-15 21:35:24,380 INFO L226 Difference]: Without dead ends: 267 [2022-10-15 21:35:24,382 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:24,384 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 177 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:24,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 819 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-15 21:35:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 259. [2022-10-15 21:35:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 195 states have (on average 1.3076923076923077) internal successors, (255), 206 states have internal predecessors, (255), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-10-15 21:35:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 329 transitions. [2022-10-15 21:35:24,424 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 329 transitions. Word has length 37 [2022-10-15 21:35:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:24,424 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 329 transitions. [2022-10-15 21:35:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 329 transitions. [2022-10-15 21:35:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-15 21:35:24,432 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:24,435 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] [2022-10-15 21:35:24,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:35:24,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash -185703341, now seen corresponding path program 1 times [2022-10-15 21:35:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:24,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761695569] [2022-10-15 21:35:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:35:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:24,766 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:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:24,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761695569] [2022-10-15 21:35:24,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761695569] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:24,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:24,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945109057] [2022-10-15 21:35:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:24,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:24,770 INFO L87 Difference]: Start difference. First operand 259 states and 329 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 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:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:25,526 INFO L93 Difference]: Finished difference Result 513 states and 663 transitions. [2022-10-15 21:35:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 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 69 [2022-10-15 21:35:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:25,534 INFO L225 Difference]: With dead ends: 513 [2022-10-15 21:35:25,534 INFO L226 Difference]: Without dead ends: 509 [2022-10-15 21:35:25,535 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:25,537 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 324 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:25,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 997 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:35:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-10-15 21:35:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 489. [2022-10-15 21:35:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 377 states have (on average 1.3076923076923077) internal successors, (493), 390 states have internal predecessors, (493), 71 states have call successors, (71), 31 states have call predecessors, (71), 31 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-10-15 21:35:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 635 transitions. [2022-10-15 21:35:25,586 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 635 transitions. Word has length 69 [2022-10-15 21:35:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:25,587 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 635 transitions. [2022-10-15 21:35:25,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 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:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 635 transitions. [2022-10-15 21:35:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-15 21:35:25,590 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:25,591 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] [2022-10-15 21:35:25,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:35:25,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -111733358, now seen corresponding path program 1 times [2022-10-15 21:35:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:25,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778203813] [2022-10-15 21:35:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-15 21:35:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:35:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:25,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778203813] [2022-10-15 21:35:25,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778203813] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:25,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:25,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083316411] [2022-10-15 21:35:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:25,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:25,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:25,880 INFO L87 Difference]: Start difference. First operand 489 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 21:35:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:26,453 INFO L93 Difference]: Finished difference Result 982 states and 1285 transitions. [2022-10-15 21:35:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:35:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 71 [2022-10-15 21:35:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:26,460 INFO L225 Difference]: With dead ends: 982 [2022-10-15 21:35:26,460 INFO L226 Difference]: Without dead ends: 512 [2022-10-15 21:35:26,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:35:26,464 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 296 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:26,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 884 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-10-15 21:35:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 496. [2022-10-15 21:35:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 399 states have internal predecessors, (503), 67 states have call successors, (67), 33 states have call predecessors, (67), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-10-15 21:35:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 637 transitions. [2022-10-15 21:35:26,512 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 637 transitions. Word has length 71 [2022-10-15 21:35:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:26,513 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 637 transitions. [2022-10-15 21:35:26,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 21:35:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 637 transitions. [2022-10-15 21:35:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-15 21:35:26,515 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:26,515 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] [2022-10-15 21:35:26,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:35:26,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1982112155, now seen corresponding path program 1 times [2022-10-15 21:35:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:26,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818981775] [2022-10-15 21:35:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:35:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:26,816 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:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:26,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818981775] [2022-10-15 21:35:26,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818981775] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:26,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:26,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 21:35:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390077466] [2022-10-15 21:35:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:26,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:35:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:35:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:26,820 INFO L87 Difference]: Start difference. First operand 496 states and 637 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:27,362 INFO L93 Difference]: Finished difference Result 1316 states and 1738 transitions. [2022-10-15 21:35:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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 72 [2022-10-15 21:35:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:27,378 INFO L225 Difference]: With dead ends: 1316 [2022-10-15 21:35:27,378 INFO L226 Difference]: Without dead ends: 852 [2022-10-15 21:35:27,381 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:27,387 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 424 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:27,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1641 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-10-15 21:35:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 502. [2022-10-15 21:35:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 392 states have (on average 1.2984693877551021) internal successors, (509), 405 states have internal predecessors, (509), 67 states have call successors, (67), 33 states have call predecessors, (67), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-10-15 21:35:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 643 transitions. [2022-10-15 21:35:27,473 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 643 transitions. Word has length 72 [2022-10-15 21:35:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:27,476 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 643 transitions. [2022-10-15 21:35:27,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 643 transitions. [2022-10-15 21:35:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-15 21:35:27,480 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:27,480 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] [2022-10-15 21:35:27,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:35:27,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1575783582, now seen corresponding path program 1 times [2022-10-15 21:35:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:27,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478560813] [2022-10-15 21:35:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:27,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:35:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:35:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:28,114 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:28,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:28,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478560813] [2022-10-15 21:35:28,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478560813] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:28,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:28,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 21:35:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410132956] [2022-10-15 21:35:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:28,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:35:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:35:28,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:28,125 INFO L87 Difference]: Start difference. First operand 502 states and 643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 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:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:28,659 INFO L93 Difference]: Finished difference Result 996 states and 1288 transitions. [2022-10-15 21:35:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 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 74 [2022-10-15 21:35:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:28,669 INFO L225 Difference]: With dead ends: 996 [2022-10-15 21:35:28,670 INFO L226 Difference]: Without dead ends: 526 [2022-10-15 21:35:28,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:35:28,675 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:28,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1247 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-10-15 21:35:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 510. [2022-10-15 21:35:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 398 states have (on average 1.2939698492462313) internal successors, (515), 411 states have internal predecessors, (515), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (77), 69 states have call predecessors, (77), 67 states have call successors, (77) [2022-10-15 21:35:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 659 transitions. [2022-10-15 21:35:28,731 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 659 transitions. Word has length 74 [2022-10-15 21:35:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:28,732 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 659 transitions. [2022-10-15 21:35:28,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 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:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 659 transitions. [2022-10-15 21:35:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-15 21:35:28,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:28,733 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] [2022-10-15 21:35:28,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:35:28,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:35:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1210529236, now seen corresponding path program 1 times [2022-10-15 21:35:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:28,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643660343] [2022-10-15 21:35:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:35:29,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:35:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:35:29,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:35:29,252 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:35:29,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-10-15 21:35:29,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-10-15 21:35:29,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-10-15 21:35:29,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-10-15 21:35:29,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-10-15 21:35:29,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-10-15 21:35:29,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-10-15 21:35:29,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-10-15 21:35:29,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-10-15 21:35:29,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-10-15 21:35:29,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:35:29,263 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:29,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:35:29,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:35:29 BoogieIcfgContainer [2022-10-15 21:35:29,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:35:29,468 INFO L158 Benchmark]: Toolchain (without parser) took 10833.13ms. Allocated memory was 151.0MB in the beginning and 254.8MB in the end (delta: 103.8MB). Free memory was 120.0MB in the beginning and 170.4MB in the end (delta: -50.4MB). Peak memory consumption was 145.5MB. Max. memory is 8.0GB. [2022-10-15 21:35:29,468 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:35:29,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1490.28ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 83.7MB in the end (delta: 36.0MB). Peak memory consumption was 37.1MB. Max. memory is 8.0GB. [2022-10-15 21:35:29,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.49ms. Allocated memory is still 151.0MB. Free memory was 83.7MB in the beginning and 76.9MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:29,469 INFO L158 Benchmark]: Boogie Preprocessor took 141.05ms. Allocated memory is still 151.0MB. Free memory was 76.9MB in the beginning and 71.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:29,470 INFO L158 Benchmark]: RCFGBuilder took 1641.56ms. Allocated memory was 151.0MB in the beginning and 208.7MB in the end (delta: 57.7MB). Free memory was 71.1MB in the beginning and 137.4MB in the end (delta: -66.2MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:29,471 INFO L158 Benchmark]: TraceAbstraction took 7367.26ms. Allocated memory was 208.7MB in the beginning and 254.8MB in the end (delta: 46.1MB). Free memory was 136.8MB in the beginning and 170.4MB in the end (delta: -33.6MB). Peak memory consumption was 104.3MB. Max. memory is 8.0GB. [2022-10-15 21:35:29,474 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.67ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1490.28ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 83.7MB in the end (delta: 36.0MB). Peak memory consumption was 37.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 176.49ms. Allocated memory is still 151.0MB. Free memory was 83.7MB in the beginning and 76.9MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 141.05ms. Allocated memory is still 151.0MB. Free memory was 76.9MB in the beginning and 71.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1641.56ms. Allocated memory was 151.0MB in the beginning and 208.7MB in the end (delta: 57.7MB). Free memory was 71.1MB in the beginning and 137.4MB in the end (delta: -66.2MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. * TraceAbstraction took 7367.26ms. Allocated memory was 208.7MB in the beginning and 254.8MB in the end (delta: 46.1MB). Free memory was 136.8MB in the beginning and 170.4MB in the end (delta: -33.6MB). Peak memory consumption was 104.3MB. 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: 3383]: 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 3839, overapproximation of bitwiseAnd at line 3309. Possible FailurePath: [L3543] int LDV_IN_INTERRUPT = 1; [L3544] int ref_cnt ; [L3545] int ldv_state_variable_1 ; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L3548] int ldv_state_variable_0 ; [L3832-L3836] 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}}; [L3837] struct usb_device_id const __mod_usb_device_table ; [L3838-L3843] 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}; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4066] int URB_STATE = 0; [L4067] int DEV_STATE = 0; [L4068] int INTERF_STATE = 0; [L4069] int SERIAL_STATE = 0; [L4070] void *usb_intfdata = (void *)0; [L4071] struct urb *int_urb = (struct urb *)0; [L4072] struct urb *bulk_urb = (struct urb *)0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4074] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] 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, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] 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, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] 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, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] 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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] 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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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={8589934595:8589934598}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] 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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={15:0}, ldv_func_arg1={15:0}, ldv_func_arg2={8589934595:8589934598}, ldv_func_arg2={8589934595:8589934598}, 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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, driver={15:0}, driver={15:0}, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-4294967295:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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={8589934595:8589934598}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-4294967295:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1070, \result={-4294967295:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-4294967295:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-4294967295: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-4294967295:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-4294967295:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \result={-4294967295:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-4294967295:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] 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={8589934595:8589934598}, bulk_urb={0:0}, dev={-4294967295:0}, DEV_STATE=0, id={4294967297:0}, id={4294967297:0}, int_urb={0:0}, INTERF_STATE=0, interface={8589934597:-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={-4294967295:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, epd={8589934596:59}, epd={8589934596:59}, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] 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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, epd={8589934596:59}, epd={8589934596:59}, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] 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={8589934595:8589934598}, bulk_urb={0:0}, dev={-4294967295:0}, dev={-4294967295:0}, dev->devnum=8388608, DEV_STATE=0, endpoint=128, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3383] 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={8589934595:8589934598}, bulk_urb={0:0}, dev={-4294967295:0}, dev={-4294967295:0}, dev->devnum=8388608, DEV_STATE=0, endpoint=128, int_urb={0: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, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] - UnprovableResult [Line: 4110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3383]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4099]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4099]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3904]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3904]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: 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, 257 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1538 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1457 mSDsluCounter, 6288 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4395 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1770 IncrementalHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 1893 mSDtfsCounter, 1770 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 417 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 64/64 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:29,530 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...