/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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:12:04,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:12:04,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:12:04,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:12:04,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:12:04,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:12:04,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:12:04,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:12:04,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:12:05,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:12:05,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:12:05,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:12:05,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:12:05,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:12:05,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:12:05,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:12:05,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:12:05,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:12:05,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:12:05,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:12:05,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:12:05,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:12:05,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:12:05,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:12:05,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:12:05,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:12:05,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:12:05,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:12:05,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:12:05,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:12:05,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:12:05,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:12:05,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:12:05,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:12:05,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:12:05,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:12:05,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:12:05,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:12:05,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:12:05,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:12:05,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:12:05,056 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-16 13:12:05,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:12:05,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:12:05,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:12:05,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:12:05,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:12:05,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:12:05,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:12:05,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:12:05,091 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:12:05,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:12:05,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:12:05,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:12:05,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:12:05,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:12:05,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:12:05,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:12:05,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:12:05,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:12:05,093 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:12:05,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:12:05,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:12:05,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:12:05,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:12:05,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:12:05,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:12:05,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:12:05,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:12:05,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:12:05,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:12:05,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:12:05,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:12:05,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:12:05,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:12:05,096 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-16 13:12:05,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:12:05,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:12:05,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:12:05,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:12:05,505 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:12:05,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-10-16 13:12:05,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db2ddcfb/75a6cd9827a64eaaa31c24d6c555ad1f/FLAGbcb7eae0a [2022-10-16 13:12:06,619 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:12:06,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-10-16 13:12:06,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db2ddcfb/75a6cd9827a64eaaa31c24d6c555ad1f/FLAGbcb7eae0a [2022-10-16 13:12:07,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db2ddcfb/75a6cd9827a64eaaa31c24d6c555ad1f [2022-10-16 13:12:07,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:12:07,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:12:07,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:12:07,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:12:07,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:12:07,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:12:07" (1/1) ... [2022-10-16 13:12:07,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f27dd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:07, skipping insertion in model container [2022-10-16 13:12:07,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:12:07" (1/1) ... [2022-10-16 13:12:07,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:12:07,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:12:08,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-10-16 13:12:08,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:12:08,599 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:12:08,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-10-16 13:12:08,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:12:08,850 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:12:08,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08 WrapperNode [2022-10-16 13:12:08,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:12:08,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:12:08,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:12:08,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:12:08,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:08,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:08,994 INFO L138 Inliner]: procedures = 102, calls = 315, calls flagged for inlining = 35, calls inlined = 32, statements flattened = 1011 [2022-10-16 13:12:08,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:12:08,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:12:08,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:12:08,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:12:09,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:12:09,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:12:09,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:12:09,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:12:09,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (1/1) ... [2022-10-16 13:12:09,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:12:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:12:09,322 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-16 13:12:09,346 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-16 13:12:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 13:12:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-16 13:12:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-16 13:12:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-10-16 13:12:09,388 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-10-16 13:12:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 13:12:09,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 13:12:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:12:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2022-10-16 13:12:09,389 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2022-10-16 13:12:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-10-16 13:12:09,390 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-10-16 13:12:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-10-16 13:12:09,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-10-16 13:12:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-10-16 13:12:09,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-10-16 13:12:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:12:09,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:12:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2022-10-16 13:12:09,391 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2022-10-16 13:12:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-10-16 13:12:09,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-10-16 13:12:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-10-16 13:12:09,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-10-16 13:12:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 13:12:09,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 13:12:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:12:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 13:12:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 13:12:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-10-16 13:12:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-10-16 13:12:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-10-16 13:12:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-10-16 13:12:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2022-10-16 13:12:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2022-10-16 13:12:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 13:12:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 13:12:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:12:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:12:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:12:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:12:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:12:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:12:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:12:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-10-16 13:12:09,395 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-10-16 13:12:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-10-16 13:12:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-10-16 13:12:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2022-10-16 13:12:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2022-10-16 13:12:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 13:12:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-16 13:12:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-16 13:12:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-16 13:12:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:12:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:12:09,840 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:12:09,852 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:12:10,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 13:12:12,249 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:12:12,271 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:12:12,272 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 13:12:12,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:12:12 BoogieIcfgContainer [2022-10-16 13:12:12,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:12:12,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:12:12,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:12:12,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:12:12,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:12:07" (1/3) ... [2022-10-16 13:12:12,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d86dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:12:12, skipping insertion in model container [2022-10-16 13:12:12,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:08" (2/3) ... [2022-10-16 13:12:12,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d86dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:12:12, skipping insertion in model container [2022-10-16 13:12:12,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:12:12" (3/3) ... [2022-10-16 13:12:12,291 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-10-16 13:12:12,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:12:12,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-10-16 13:12:12,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:12:12,444 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;@61388760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:12:12,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-10-16 13:12:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 256 states have (on average 1.45703125) internal successors, (373), 287 states have internal predecessors, (373), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-10-16 13:12:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 13:12:12,469 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:12,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:12,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1257228939, now seen corresponding path program 1 times [2022-10-16 13:12:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:12,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497211140] [2022-10-16 13:12:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:13,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 13:12:13,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497211140] [2022-10-16 13:12:13,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497211140] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:13,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:13,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:13,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610652285] [2022-10-16 13:12:13,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:13,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:13,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:13,350 INFO L87 Difference]: Start difference. First operand has 357 states, 256 states have (on average 1.45703125) internal successors, (373), 287 states have internal predecessors, (373), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:12:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:16,018 INFO L93 Difference]: Finished difference Result 1192 states and 1737 transitions. [2022-10-16 13:12:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:16,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-10-16 13:12:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:16,061 INFO L225 Difference]: With dead ends: 1192 [2022-10-16 13:12:16,062 INFO L226 Difference]: Without dead ends: 807 [2022-10-16 13:12:16,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:12:16,088 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 956 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:16,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1391 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-10-16 13:12:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-10-16 13:12:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 583. [2022-10-16 13:12:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 436 states have (on average 1.4128440366972477) internal successors, (616), 457 states have internal predecessors, (616), 91 states have call successors, (91), 34 states have call predecessors, (91), 34 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-10-16 13:12:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 798 transitions. [2022-10-16 13:12:16,286 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 798 transitions. Word has length 30 [2022-10-16 13:12:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:16,296 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 798 transitions. [2022-10-16 13:12:16,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:12:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 798 transitions. [2022-10-16 13:12:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 13:12:16,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:16,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:16,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:12:16,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:16,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1095120844, now seen corresponding path program 1 times [2022-10-16 13:12:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136606382] [2022-10-16 13:12:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 13:12:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:16,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136606382] [2022-10-16 13:12:16,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136606382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:16,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:16,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:12:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125938387] [2022-10-16 13:12:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:12:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:12:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:12:16,601 INFO L87 Difference]: Start difference. First operand 583 states and 798 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 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-16 13:12:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:19,224 INFO L93 Difference]: Finished difference Result 1597 states and 2273 transitions. [2022-10-16 13:12:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:12:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 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-16 13:12:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:19,235 INFO L225 Difference]: With dead ends: 1597 [2022-10-16 13:12:19,235 INFO L226 Difference]: Without dead ends: 1028 [2022-10-16 13:12:19,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-16 13:12:19,240 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 575 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:19,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1397 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-10-16 13:12:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-10-16 13:12:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 677. [2022-10-16 13:12:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 520 states have (on average 1.4211538461538462) internal successors, (739), 541 states have internal predecessors, (739), 96 states have call successors, (96), 39 states have call predecessors, (96), 39 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-16 13:12:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 931 transitions. [2022-10-16 13:12:19,320 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 931 transitions. Word has length 37 [2022-10-16 13:12:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:19,320 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 931 transitions. [2022-10-16 13:12:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 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-16 13:12:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 931 transitions. [2022-10-16 13:12:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 13:12:19,331 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:19,331 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 13:12:19,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:12:19,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 712690238, now seen corresponding path program 1 times [2022-10-16 13:12:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:19,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507717939] [2022-10-16 13:12:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 13:12:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:19,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507717939] [2022-10-16 13:12:19,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507717939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:19,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:19,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:19,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219067603] [2022-10-16 13:12:19,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:19,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:19,589 INFO L87 Difference]: Start difference. First operand 677 states and 931 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 13:12:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:21,536 INFO L93 Difference]: Finished difference Result 1535 states and 2164 transitions. [2022-10-16 13:12:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:12:21,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-10-16 13:12:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:21,544 INFO L225 Difference]: With dead ends: 1535 [2022-10-16 13:12:21,544 INFO L226 Difference]: Without dead ends: 881 [2022-10-16 13:12:21,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:12:21,548 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 261 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:21,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1305 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-10-16 13:12:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-10-16 13:12:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 671. [2022-10-16 13:12:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 514 states have (on average 1.4221789883268483) internal successors, (731), 536 states have internal predecessors, (731), 96 states have call successors, (96), 39 states have call predecessors, (96), 39 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-16 13:12:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 923 transitions. [2022-10-16 13:12:21,606 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 923 transitions. Word has length 49 [2022-10-16 13:12:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:21,606 INFO L495 AbstractCegarLoop]: Abstraction has 671 states and 923 transitions. [2022-10-16 13:12:21,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 13:12:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 923 transitions. [2022-10-16 13:12:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 13:12:21,608 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:21,608 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:21,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:12:21,609 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash -381870678, now seen corresponding path program 1 times [2022-10-16 13:12:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:21,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553235625] [2022-10-16 13:12:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 13:12:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:21,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553235625] [2022-10-16 13:12:21,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553235625] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:21,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:21,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:12:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573962127] [2022-10-16 13:12:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:21,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:21,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:21,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:21,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:21,911 INFO L87 Difference]: Start difference. First operand 671 states and 923 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 13:12:23,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:12:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:25,321 INFO L93 Difference]: Finished difference Result 1722 states and 2469 transitions. [2022-10-16 13:12:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:25,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-10-16 13:12:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:25,339 INFO L225 Difference]: With dead ends: 1722 [2022-10-16 13:12:25,340 INFO L226 Difference]: Without dead ends: 1712 [2022-10-16 13:12:25,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:12:25,345 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 965 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:25,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1295 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-10-16 13:12:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-10-16 13:12:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1295. [2022-10-16 13:12:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1010 states have (on average 1.4079207920792078) internal successors, (1422), 1033 states have internal predecessors, (1422), 188 states have call successors, (188), 75 states have call predecessors, (188), 75 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2022-10-16 13:12:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1798 transitions. [2022-10-16 13:12:25,479 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1798 transitions. Word has length 68 [2022-10-16 13:12:25,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:25,480 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1798 transitions. [2022-10-16 13:12:25,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 13:12:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1798 transitions. [2022-10-16 13:12:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 13:12:25,486 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:25,487 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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-16 13:12:25,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:12:25,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2071637374, now seen corresponding path program 1 times [2022-10-16 13:12:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713287900] [2022-10-16 13:12:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 13:12:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:25,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713287900] [2022-10-16 13:12:25,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713287900] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:25,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:25,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221918156] [2022-10-16 13:12:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:25,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:25,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:25,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:25,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:25,846 INFO L87 Difference]: Start difference. First operand 1295 states and 1798 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:12:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:29,735 INFO L93 Difference]: Finished difference Result 3774 states and 5391 transitions. [2022-10-16 13:12:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-10-16 13:12:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:29,764 INFO L225 Difference]: With dead ends: 3774 [2022-10-16 13:12:29,764 INFO L226 Difference]: Without dead ends: 2504 [2022-10-16 13:12:29,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:12:29,775 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 685 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:29,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2014 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-10-16 13:12:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2022-10-16 13:12:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 1887. [2022-10-16 13:12:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1484 states have (on average 1.4056603773584906) internal successors, (2086), 1507 states have internal predecessors, (2086), 270 states have call successors, (270), 111 states have call predecessors, (270), 111 states have return successors, (270), 268 states have call predecessors, (270), 270 states have call successors, (270) [2022-10-16 13:12:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2626 transitions. [2022-10-16 13:12:29,928 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2626 transitions. Word has length 77 [2022-10-16 13:12:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:29,928 INFO L495 AbstractCegarLoop]: Abstraction has 1887 states and 2626 transitions. [2022-10-16 13:12:29,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 13:12:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2626 transitions. [2022-10-16 13:12:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 13:12:29,931 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:29,932 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:29,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:12:29,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1492822151, now seen corresponding path program 1 times [2022-10-16 13:12:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:29,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615977500] [2022-10-16 13:12:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 13:12:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 13:12:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 13:12:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:30,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615977500] [2022-10-16 13:12:30,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615977500] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:30,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:30,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978060737] [2022-10-16 13:12:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:30,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:30,275 INFO L87 Difference]: Start difference. First operand 1887 states and 2626 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 13:12:31,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:12:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:34,145 INFO L93 Difference]: Finished difference Result 3980 states and 5658 transitions. [2022-10-16 13:12:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 80 [2022-10-16 13:12:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:34,164 INFO L225 Difference]: With dead ends: 3980 [2022-10-16 13:12:34,164 INFO L226 Difference]: Without dead ends: 2118 [2022-10-16 13:12:34,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:12:34,174 INFO L413 NwaCegarLoop]: 614 mSDtfsCounter, 840 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:34,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1693 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-10-16 13:12:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2022-10-16 13:12:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1598. [2022-10-16 13:12:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1260 states have (on average 1.4047619047619047) internal successors, (1770), 1283 states have internal predecessors, (1770), 225 states have call successors, (225), 91 states have call predecessors, (225), 91 states have return successors, (225), 223 states have call predecessors, (225), 225 states have call successors, (225) [2022-10-16 13:12:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2220 transitions. [2022-10-16 13:12:34,309 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2220 transitions. Word has length 80 [2022-10-16 13:12:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:34,310 INFO L495 AbstractCegarLoop]: Abstraction has 1598 states and 2220 transitions. [2022-10-16 13:12:34,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 13:12:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2220 transitions. [2022-10-16 13:12:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-16 13:12:34,312 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:34,312 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:34,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:12:34,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1726302016, now seen corresponding path program 1 times [2022-10-16 13:12:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:34,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794856314] [2022-10-16 13:12:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 13:12:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-16 13:12:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:34,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794856314] [2022-10-16 13:12:34,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794856314] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:34,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:34,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:12:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902171704] [2022-10-16 13:12:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:34,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:12:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:12:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:12:34,924 INFO L87 Difference]: Start difference. First operand 1598 states and 2220 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-16 13:12:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:37,073 INFO L93 Difference]: Finished difference Result 3619 states and 5179 transitions. [2022-10-16 13:12:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:12:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2022-10-16 13:12:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:37,089 INFO L225 Difference]: With dead ends: 3619 [2022-10-16 13:12:37,089 INFO L226 Difference]: Without dead ends: 2061 [2022-10-16 13:12:37,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-16 13:12:37,100 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 236 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:37,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 2013 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-10-16 13:12:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2022-10-16 13:12:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1618. [2022-10-16 13:12:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1275 states have (on average 1.4) internal successors, (1785), 1298 states have internal predecessors, (1785), 225 states have call successors, (225), 91 states have call predecessors, (225), 96 states have return successors, (238), 228 states have call predecessors, (238), 225 states have call successors, (238) [2022-10-16 13:12:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2248 transitions. [2022-10-16 13:12:37,212 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2248 transitions. Word has length 85 [2022-10-16 13:12:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:37,212 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 2248 transitions. [2022-10-16 13:12:37,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-16 13:12:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2248 transitions. [2022-10-16 13:12:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-16 13:12:37,215 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:37,215 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:37,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 13:12:37,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -301737407, now seen corresponding path program 1 times [2022-10-16 13:12:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:37,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291146744] [2022-10-16 13:12:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:12:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 13:12:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:37,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291146744] [2022-10-16 13:12:37,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291146744] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:12:37,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129969948] [2022-10-16 13:12:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:37,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:12:37,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:12:37,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:12:37,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 13:12:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:37,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:12:37,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:12:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-16 13:12:38,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:12:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 13:12:38,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129969948] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:12:38,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:12:38,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-16 13:12:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196230964] [2022-10-16 13:12:38,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:12:38,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 13:12:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 13:12:38,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:12:38,224 INFO L87 Difference]: Start difference. First operand 1618 states and 2248 transitions. Second operand has 9 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 6 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-10-16 13:12:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:43,495 INFO L93 Difference]: Finished difference Result 6805 states and 9856 transitions. [2022-10-16 13:12:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 13:12:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 6 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 82 [2022-10-16 13:12:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:43,546 INFO L225 Difference]: With dead ends: 6805 [2022-10-16 13:12:43,547 INFO L226 Difference]: Without dead ends: 6800 [2022-10-16 13:12:43,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2022-10-16 13:12:43,553 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 3671 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 1146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3849 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1146 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:43,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3849 Valid, 2826 Invalid, 2936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1146 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-10-16 13:12:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2022-10-16 13:12:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 4017. [2022-10-16 13:12:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3189 states have (on average 1.3994982753214174) internal successors, (4463), 3215 states have internal predecessors, (4463), 569 states have call successors, (569), 227 states have call predecessors, (569), 240 states have return successors, (598), 574 states have call predecessors, (598), 569 states have call successors, (598) [2022-10-16 13:12:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5630 transitions. [2022-10-16 13:12:43,977 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5630 transitions. Word has length 82 [2022-10-16 13:12:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:43,978 INFO L495 AbstractCegarLoop]: Abstraction has 4017 states and 5630 transitions. [2022-10-16 13:12:43,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 6 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-10-16 13:12:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5630 transitions. [2022-10-16 13:12:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-10-16 13:12:43,982 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:43,982 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:44,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 13:12:44,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:12:44,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash -763924675, now seen corresponding path program 1 times [2022-10-16 13:12:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:44,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806602514] [2022-10-16 13:12:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:12:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 13:12:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806602514] [2022-10-16 13:12:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806602514] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:12:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054649996] [2022-10-16 13:12:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:44,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:12:44,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:12:44,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:12:44,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 13:12:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:44,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:12:44,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:12:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-16 13:12:45,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:12:45,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054649996] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:45,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:12:45,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-16 13:12:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591279009] [2022-10-16 13:12:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:45,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:12:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:12:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:12:45,018 INFO L87 Difference]: Start difference. First operand 4017 states and 5630 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 13:12:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:46,144 INFO L93 Difference]: Finished difference Result 8944 states and 12538 transitions. [2022-10-16 13:12:46,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:12:46,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-10-16 13:12:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:46,206 INFO L225 Difference]: With dead ends: 8944 [2022-10-16 13:12:46,207 INFO L226 Difference]: Without dead ends: 8939 [2022-10-16 13:12:46,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:12:46,213 INFO L413 NwaCegarLoop]: 808 mSDtfsCounter, 799 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:46,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1659 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 13:12:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8939 states. [2022-10-16 13:12:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8939 to 8558. [2022-10-16 13:12:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 6804 states have (on average 1.396090534979424) internal successors, (9499), 6833 states have internal predecessors, (9499), 1218 states have call successors, (1218), 489 states have call predecessors, (1218), 517 states have return successors, (1274), 1235 states have call predecessors, (1274), 1218 states have call successors, (1274) [2022-10-16 13:12:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 11991 transitions. [2022-10-16 13:12:46,824 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 11991 transitions. Word has length 83 [2022-10-16 13:12:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:46,825 INFO L495 AbstractCegarLoop]: Abstraction has 8558 states and 11991 transitions. [2022-10-16 13:12:46,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 13:12:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 11991 transitions. [2022-10-16 13:12:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 13:12:46,828 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:46,828 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:46,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 13:12:47,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-16 13:12:47,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1548387049, now seen corresponding path program 1 times [2022-10-16 13:12:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:47,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903622309] [2022-10-16 13:12:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 13:12:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:12:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-10-16 13:12:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903622309] [2022-10-16 13:12:47,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903622309] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:47,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:47,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:12:47,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452157054] [2022-10-16 13:12:47,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:47,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:47,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:47,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:47,583 INFO L87 Difference]: Start difference. First operand 8558 states and 11991 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:12:48,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:12:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:51,606 INFO L93 Difference]: Finished difference Result 30367 states and 44184 transitions. [2022-10-16 13:12:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2022-10-16 13:12:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:51,727 INFO L225 Difference]: With dead ends: 30367 [2022-10-16 13:12:51,728 INFO L226 Difference]: Without dead ends: 21834 [2022-10-16 13:12:51,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:12:51,773 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 894 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:51,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1387 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-10-16 13:12:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21834 states. [2022-10-16 13:12:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21834 to 18080. [2022-10-16 13:12:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18080 states, 14458 states have (on average 1.3920320929589154) internal successors, (20126), 14526 states have internal predecessors, (20126), 2488 states have call successors, (2488), 975 states have call predecessors, (2488), 1115 states have return successors, (2908), 2578 states have call predecessors, (2908), 2488 states have call successors, (2908) [2022-10-16 13:12:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18080 states to 18080 states and 25522 transitions. [2022-10-16 13:12:53,519 INFO L78 Accepts]: Start accepts. Automaton has 18080 states and 25522 transitions. Word has length 92 [2022-10-16 13:12:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:53,520 INFO L495 AbstractCegarLoop]: Abstraction has 18080 states and 25522 transitions. [2022-10-16 13:12:53,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:12:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18080 states and 25522 transitions. [2022-10-16 13:12:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-16 13:12:53,523 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:53,523 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:53,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 13:12:53,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:12:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 89382452, now seen corresponding path program 1 times [2022-10-16 13:12:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:53,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883059742] [2022-10-16 13:12:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:12:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:12:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:12:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:12:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:12:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:12:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-16 13:12:53,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:53,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883059742] [2022-10-16 13:12:53,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883059742] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:53,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:53,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:12:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446843881] [2022-10-16 13:12:53,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:53,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:12:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:53,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:12:53,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:12:53,747 INFO L87 Difference]: Start difference. First operand 18080 states and 25522 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 13:12:56,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:12:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:59,335 INFO L93 Difference]: Finished difference Result 39213 states and 56930 transitions. [2022-10-16 13:12:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:12:59,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2022-10-16 13:12:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:59,444 INFO L225 Difference]: With dead ends: 39213 [2022-10-16 13:12:59,444 INFO L226 Difference]: Without dead ends: 21158 [2022-10-16 13:12:59,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:12:59,519 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 971 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:59,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1683 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-10-16 13:12:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21158 states. [2022-10-16 13:13:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21158 to 14725. [2022-10-16 13:13:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14725 states, 11607 states have (on average 1.3671922115964503) internal successors, (15869), 11715 states have internal predecessors, (15869), 2130 states have call successors, (2130), 769 states have call predecessors, (2130), 969 states have return successors, (2935), 2240 states have call predecessors, (2935), 2130 states have call successors, (2935) [2022-10-16 13:13:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14725 states to 14725 states and 20934 transitions. [2022-10-16 13:13:01,281 INFO L78 Accepts]: Start accepts. Automaton has 14725 states and 20934 transitions. Word has length 85 [2022-10-16 13:13:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:01,282 INFO L495 AbstractCegarLoop]: Abstraction has 14725 states and 20934 transitions. [2022-10-16 13:13:01,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 13:13:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 14725 states and 20934 transitions. [2022-10-16 13:13:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-10-16 13:13:01,290 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:01,290 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:01,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 13:13:01,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:01,291 INFO L85 PathProgramCache]: Analyzing trace with hash -755432573, now seen corresponding path program 1 times [2022-10-16 13:13:01,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:01,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927993906] [2022-10-16 13:13:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:13:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:13:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:13:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:13:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:13:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:13:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 13:13:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-10-16 13:13:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927993906] [2022-10-16 13:13:01,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927993906] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:01,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:01,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:13:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471256595] [2022-10-16 13:13:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:01,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:13:01,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:01,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:13:01,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:01,864 INFO L87 Difference]: Start difference. First operand 14725 states and 20934 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:06,438 INFO L93 Difference]: Finished difference Result 32469 states and 47095 transitions. [2022-10-16 13:13:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:13:06,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2022-10-16 13:13:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:06,531 INFO L225 Difference]: With dead ends: 32469 [2022-10-16 13:13:06,531 INFO L226 Difference]: Without dead ends: 17797 [2022-10-16 13:13:06,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:13:06,575 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 895 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:06,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1657 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-10-16 13:13:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17797 states. [2022-10-16 13:13:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17797 to 14600. [2022-10-16 13:13:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14600 states, 11482 states have (on average 1.362480404110782) internal successors, (15644), 11590 states have internal predecessors, (15644), 2130 states have call successors, (2130), 769 states have call predecessors, (2130), 969 states have return successors, (2935), 2240 states have call predecessors, (2935), 2130 states have call successors, (2935) [2022-10-16 13:13:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 20709 transitions. [2022-10-16 13:13:07,944 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 20709 transitions. Word has length 93 [2022-10-16 13:13:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:07,945 INFO L495 AbstractCegarLoop]: Abstraction has 14600 states and 20709 transitions. [2022-10-16 13:13:07,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 20709 transitions. [2022-10-16 13:13:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 13:13:07,949 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:07,949 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:07,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 13:13:07,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:07,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1138037100, now seen corresponding path program 1 times [2022-10-16 13:13:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:07,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576196462] [2022-10-16 13:13:07,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:13:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:13:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:13:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:13:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:13:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:13:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-16 13:13:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 13:13:08,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576196462] [2022-10-16 13:13:08,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576196462] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:08,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:08,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:13:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006791910] [2022-10-16 13:13:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:08,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:13:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:13:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:08,252 INFO L87 Difference]: Start difference. First operand 14600 states and 20709 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:13,008 INFO L93 Difference]: Finished difference Result 39429 states and 58920 transitions. [2022-10-16 13:13:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:13:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2022-10-16 13:13:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:13,153 INFO L225 Difference]: With dead ends: 39429 [2022-10-16 13:13:13,153 INFO L226 Difference]: Without dead ends: 24882 [2022-10-16 13:13:13,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:13:13,207 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 410 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:13,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1761 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-10-16 13:13:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24882 states. [2022-10-16 13:13:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24882 to 17300. [2022-10-16 13:13:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17300 states, 13682 states have (on average 1.3553574038883205) internal successors, (18544), 13790 states have internal predecessors, (18544), 2630 states have call successors, (2630), 769 states have call predecessors, (2630), 969 states have return successors, (3735), 2740 states have call predecessors, (3735), 2630 states have call successors, (3735) [2022-10-16 13:13:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17300 states to 17300 states and 24909 transitions. [2022-10-16 13:13:15,130 INFO L78 Accepts]: Start accepts. Automaton has 17300 states and 24909 transitions. Word has length 92 [2022-10-16 13:13:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:15,131 INFO L495 AbstractCegarLoop]: Abstraction has 17300 states and 24909 transitions. [2022-10-16 13:13:15,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 17300 states and 24909 transitions. [2022-10-16 13:13:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-10-16 13:13:15,134 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:15,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 13:13:15,134 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1646033427, now seen corresponding path program 1 times [2022-10-16 13:13:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803432834] [2022-10-16 13:13:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:13:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:13:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:13:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:13:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:13:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:13:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 13:13:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 13:13:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803432834] [2022-10-16 13:13:15,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803432834] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:15,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:15,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:13:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561799033] [2022-10-16 13:13:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:15,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:13:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:15,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:13:15,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:15,405 INFO L87 Difference]: Start difference. First operand 17300 states and 24909 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:20,367 INFO L93 Difference]: Finished difference Result 46529 states and 70420 transitions. [2022-10-16 13:13:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:13:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2022-10-16 13:13:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:20,478 INFO L225 Difference]: With dead ends: 46529 [2022-10-16 13:13:20,478 INFO L226 Difference]: Without dead ends: 29282 [2022-10-16 13:13:20,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:13:20,527 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 465 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:20,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1542 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-10-16 13:13:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29282 states. [2022-10-16 13:13:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29282 to 20000. [2022-10-16 13:13:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20000 states, 15882 states have (on average 1.3612265457750914) internal successors, (21619), 15990 states have internal predecessors, (21619), 3130 states have call successors, (3130), 769 states have call predecessors, (3130), 969 states have return successors, (4535), 3240 states have call predecessors, (4535), 3130 states have call successors, (4535) [2022-10-16 13:13:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20000 states to 20000 states and 29284 transitions. [2022-10-16 13:13:22,782 INFO L78 Accepts]: Start accepts. Automaton has 20000 states and 29284 transitions. Word has length 93 [2022-10-16 13:13:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:22,783 INFO L495 AbstractCegarLoop]: Abstraction has 20000 states and 29284 transitions. [2022-10-16 13:13:22,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20000 states and 29284 transitions. [2022-10-16 13:13:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-10-16 13:13:22,786 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:22,787 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:22,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 13:13:22,787 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1000698297, now seen corresponding path program 1 times [2022-10-16 13:13:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825691062] [2022-10-16 13:13:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:13:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:13:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:13:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:13:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:13:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:13:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:13:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 13:13:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:23,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825691062] [2022-10-16 13:13:23,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825691062] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:23,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:23,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:13:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922140633] [2022-10-16 13:13:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:23,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:13:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:13:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:13:23,216 INFO L87 Difference]: Start difference. First operand 20000 states and 29284 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:25,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:13:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:28,252 INFO L93 Difference]: Finished difference Result 48229 states and 72870 transitions. [2022-10-16 13:13:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 13:13:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2022-10-16 13:13:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:28,350 INFO L225 Difference]: With dead ends: 48229 [2022-10-16 13:13:28,351 INFO L226 Difference]: Without dead ends: 28282 [2022-10-16 13:13:28,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-16 13:13:28,413 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 399 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:28,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1762 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-10-16 13:13:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28282 states. [2022-10-16 13:13:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28282 to 20000. [2022-10-16 13:13:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20000 states, 15882 states have (on average 1.3454854552323385) internal successors, (21369), 15990 states have internal predecessors, (21369), 3130 states have call successors, (3130), 769 states have call predecessors, (3130), 969 states have return successors, (4535), 3240 states have call predecessors, (4535), 3130 states have call successors, (4535) [2022-10-16 13:13:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20000 states to 20000 states and 29034 transitions. [2022-10-16 13:13:30,162 INFO L78 Accepts]: Start accepts. Automaton has 20000 states and 29034 transitions. Word has length 94 [2022-10-16 13:13:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:30,162 INFO L495 AbstractCegarLoop]: Abstraction has 20000 states and 29034 transitions. [2022-10-16 13:13:30,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20000 states and 29034 transitions. [2022-10-16 13:13:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 13:13:30,166 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:30,166 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:30,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 13:13:30,166 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1417970200, now seen corresponding path program 1 times [2022-10-16 13:13:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:30,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378918081] [2022-10-16 13:13:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:13:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:13:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 13:13:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 13:13:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:13:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:13:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 13:13:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-16 13:13:30,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:30,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378918081] [2022-10-16 13:13:30,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378918081] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:30,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237941706] [2022-10-16 13:13:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:30,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:13:30,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 13:13:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 13:13:30,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 13:13:31,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237941706] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:31,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:31,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-10-16 13:13:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833405629] [2022-10-16 13:13:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:31,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:31,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:13:31,032 INFO L87 Difference]: Start difference. First operand 20000 states and 29034 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:32,783 INFO L93 Difference]: Finished difference Result 39985 states and 58053 transitions. [2022-10-16 13:13:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:13:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2022-10-16 13:13:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:32,844 INFO L225 Difference]: With dead ends: 39985 [2022-10-16 13:13:32,850 INFO L226 Difference]: Without dead ends: 20001 [2022-10-16 13:13:32,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:13:32,904 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 2 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:32,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1314 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:13:32,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20001 states. [2022-10-16 13:13:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20001 to 20001. [2022-10-16 13:13:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20001 states, 15883 states have (on average 1.345463703330605) internal successors, (21370), 15991 states have internal predecessors, (21370), 3130 states have call successors, (3130), 769 states have call predecessors, (3130), 969 states have return successors, (4535), 3240 states have call predecessors, (4535), 3130 states have call successors, (4535) [2022-10-16 13:13:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20001 states to 20001 states and 29035 transitions. [2022-10-16 13:13:34,613 INFO L78 Accepts]: Start accepts. Automaton has 20001 states and 29035 transitions. Word has length 95 [2022-10-16 13:13:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:34,614 INFO L495 AbstractCegarLoop]: Abstraction has 20001 states and 29035 transitions. [2022-10-16 13:13:34,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:13:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 20001 states and 29035 transitions. [2022-10-16 13:13:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 13:13:34,617 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:34,617 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:34,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:34,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:34,828 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1410377084, now seen corresponding path program 1 times [2022-10-16 13:13:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:34,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501084255] [2022-10-16 13:13:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 13:13:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 13:13:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 13:13:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 13:13:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 13:13:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 13:13:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 13:13:35,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:35,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501084255] [2022-10-16 13:13:35,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501084255] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:35,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797716336] [2022-10-16 13:13:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:35,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:35,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:13:35,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 13:13:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 13:13:36,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-10-16 13:13:36,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:13:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 13:13:36,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797716336] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:13:36,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:13:36,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2022-10-16 13:13:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912843848] [2022-10-16 13:13:36,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:13:36,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-16 13:13:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-16 13:13:36,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-10-16 13:13:36,238 INFO L87 Difference]: Start difference. First operand 20001 states and 29035 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-10-16 13:13:37,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 13:13:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:41,940 INFO L93 Difference]: Finished difference Result 48070 states and 72023 transitions. [2022-10-16 13:13:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 13:13:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 97 [2022-10-16 13:13:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:42,049 INFO L225 Difference]: With dead ends: 48070 [2022-10-16 13:13:42,049 INFO L226 Difference]: Without dead ends: 28083 [2022-10-16 13:13:42,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-10-16 13:13:42,083 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 312 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:42,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 2743 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-10-16 13:13:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28083 states. [2022-10-16 13:13:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28083 to 20004. [2022-10-16 13:13:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20004 states, 15886 states have (on average 1.3453984640564018) internal successors, (21373), 15994 states have internal predecessors, (21373), 3130 states have call successors, (3130), 769 states have call predecessors, (3130), 969 states have return successors, (4535), 3240 states have call predecessors, (4535), 3130 states have call successors, (4535) [2022-10-16 13:13:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20004 states to 20004 states and 29038 transitions. [2022-10-16 13:13:43,578 INFO L78 Accepts]: Start accepts. Automaton has 20004 states and 29038 transitions. Word has length 97 [2022-10-16 13:13:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:43,578 INFO L495 AbstractCegarLoop]: Abstraction has 20004 states and 29038 transitions. [2022-10-16 13:13:43,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-10-16 13:13:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 20004 states and 29038 transitions. [2022-10-16 13:13:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-16 13:13:43,582 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:43,582 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:43,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:43,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 13:13:43,797 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-16 13:13:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash 138211736, now seen corresponding path program 2 times [2022-10-16 13:13:43,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:43,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953001632] [2022-10-16 13:13:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:43,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:13:43,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 13:13:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:13:44,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 13:13:44,234 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 13:13:44,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location cx82310_rx_fixupErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2022-10-16 13:13:44,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2022-10-16 13:13:44,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2022-10-16 13:13:44,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2022-10-16 13:13:44,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_skb_allocErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2022-10-16 13:13:44,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_cmdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2022-10-16 13:13:44,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_cmdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2022-10-16 13:13:44,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2022-10-16 13:13:44,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __create_pipeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2022-10-16 13:13:44,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2022-10-16 13:13:44,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2022-10-16 13:13:44,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2022-10-16 13:13:44,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2022-10-16 13:13:44,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2022-10-16 13:13:44,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2022-10-16 13:13:44,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2022-10-16 13:13:44,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2022-10-16 13:13:44,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2022-10-16 13:13:44,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2022-10-16 13:13:44,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2022-10-16 13:13:44,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2022-10-16 13:13:44,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2022-10-16 13:13:44,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2022-10-16 13:13:44,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2022-10-16 13:13:44,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2022-10-16 13:13:44,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location cx82310_rx_fixupErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2022-10-16 13:13:44,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 13:13:44,250 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:44,256 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:13:44,300 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2022-10-16 13:13:44,309 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2022-10-16 13:13:44,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:13:44 BoogieIcfgContainer [2022-10-16 13:13:44,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:13:44,456 INFO L158 Benchmark]: Toolchain (without parser) took 97323.32ms. Allocated memory was 151.0MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 117.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-16 13:13:44,456 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:13:44,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1711.85ms. Allocated memory is still 151.0MB. Free memory was 117.7MB in the beginning and 58.3MB in the end (delta: 59.3MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2022-10-16 13:13:44,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.09ms. Allocated memory is still 151.0MB. Free memory was 58.3MB in the beginning and 51.5MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-16 13:13:44,457 INFO L158 Benchmark]: Boogie Preprocessor took 266.79ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 51.5MB in the beginning and 139.1MB in the end (delta: -87.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-10-16 13:13:44,458 INFO L158 Benchmark]: RCFGBuilder took 3013.81ms. Allocated memory was 184.5MB in the beginning and 280.0MB in the end (delta: 95.4MB). Free memory was 139.1MB in the beginning and 183.4MB in the end (delta: -44.4MB). Peak memory consumption was 114.2MB. Max. memory is 8.0GB. [2022-10-16 13:13:44,458 INFO L158 Benchmark]: TraceAbstraction took 92172.47ms. Allocated memory was 280.0MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 182.4MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-16 13:13:44,460 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.29ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1711.85ms. Allocated memory is still 151.0MB. Free memory was 117.7MB in the beginning and 58.3MB in the end (delta: 59.3MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 143.09ms. Allocated memory is still 151.0MB. Free memory was 58.3MB in the beginning and 51.5MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 266.79ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 51.5MB in the beginning and 139.1MB in the end (delta: -87.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * RCFGBuilder took 3013.81ms. Allocated memory was 184.5MB in the beginning and 280.0MB in the end (delta: 95.4MB). Free memory was 139.1MB in the beginning and 183.4MB in the end (delta: -44.4MB). Peak memory consumption was 114.2MB. Max. memory is 8.0GB. * TraceAbstraction took 92172.47ms. Allocated memory was 280.0MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 182.4MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * 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: 5840]: 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 5927. Possible FailurePath: [L5592] struct sk_buff *cx82310_info_group2 ; [L5593] int LDV_IN_INTERRUPT = 1; [L5594] int ldv_state_variable_2 ; [L5595] int ref_cnt ; [L5596] struct usbnet *cx82310_info_group0 ; [L5597] int ldv_state_variable_1 ; [L5598] int usb_counter ; [L5599] struct usb_interface *cx82310_info_group1 ; [L5600] struct usb_interface *cx82310_driver_group1 ; [L5601] int ldv_state_variable_0 ; [L5907-L5909] static struct driver_info const cx82310_info = {(char *)"Conexant CX82310 USB ethernet", 32, & cx82310_bind, & cx82310_unbind, 0, 0, 0, 0, 0, 0, & cx82310_rx_fixup, & cx82310_tx_fixup, 0, 0, 0, 0, 0UL}; [L5910-L5911] static struct usb_device_id const products[2U] = { {899U, 1394U, 51969U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 0U, 0U, (unsigned char)0, (unsigned long )(& cx82310_info)}}; [L5912] struct usb_device_id const __mod_usb__products_device_table ; [L5913-L5922] static struct usb_driver cx82310_driver = {"cx82310_eth", & usbnet_probe, & usbnet_disconnect, 0, & usbnet_suspend, & usbnet_resume, 0, 0, 0, (struct usb_device_id const *)(& products), {{{{{{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, 0}, 0}, (unsigned char)0, (unsigned char)0, 1U, (unsigned char)0}; [L5939] int ldv_retval_2 ; [L5940] int ldv_retval_0 ; [L5941] int ldv_retval_5 ; [L5942] int ldv_retval_4 ; [L5944] int ldv_retval_1 ; [L5946] int ldv_retval_3 ; [L6231] Element set_impl[15] ; [L6232] int last_index = 0; [L6366] Set LDV_SKBS ; VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5973] struct usb_device_id *ldvarg1 ; [L5974] void *tmp ; [L5975] pm_message_t ldvarg0 ; [L5976] gfp_t ldvarg2 ; [L5977] int tmp___0 ; [L5978] int tmp___1 ; [L5979] int tmp___2 ; [L5980] int tmp___3 ; VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={21:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5982] CALL, EXPR ldv_zalloc(32UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); VAL [\old(size)=32, \result={0:0}, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, size=32, tmp___0=-2, usb_counter=0] [L5982] RET, EXPR ldv_zalloc(32UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(32UL)={0:0}, ldvarg0={21:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5982] tmp = ldv_zalloc(32UL) [L5983] ldvarg1 = (struct usb_device_id *)tmp [L5984] CALL ldv_initialize() [L6385] CALL ldv_set_init(LDV_SKBS) [L6237] set = set_impl [L6238] last_index = 0 VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set={20:0}, set={0:0}, set_impl={20:0}, usb_counter=0] [L6385] RET ldv_set_init(LDV_SKBS) [L5984] RET ldv_initialize() [L5985] FCALL memset((void *)(& ldvarg0), 0, 4UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, memset((void *)(& ldvarg0), 0, 4UL)={21:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, usb_counter=0] [L5986] FCALL memset((void *)(& ldvarg2), 0, 4UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, memset((void *)(& ldvarg2), 0, 4UL)={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, usb_counter=0] [L5987] ldv_state_variable_1 = 0 [L5988] ref_cnt = 0 [L5989] ldv_state_variable_0 = 1 [L5990] ldv_state_variable_2 = 0 VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, usb_counter=0] [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0=1, usb_counter=0] [L6061] COND TRUE ldv_state_variable_0 != 0 [L6062] tmp___2 = __VERIFIER_nondet_int() [L6064] case 0: [L6072] case 1: VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0] [L6073] COND TRUE ldv_state_variable_0 == 1 [L6074] CALL, EXPR cx82310_driver_init() [L5925] int tmp ; [L5927] CALL, EXPR ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L6211] ldv_func_ret_type ldv_func_res ; [L6212] int tmp ; [L6214] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6487] return __VERIFIER_nondet_int(); [L6214] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6214] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6215] ldv_func_res = tmp [L6216] ldv_state_variable_1 = 1 [L6217] usb_counter = 0 [L6218] CALL ldv_usb_driver_1() [L5964] void *tmp ; VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5966] CALL, EXPR ldv_zalloc(1560UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); VAL [\old(size)=1560, \result={0:0}, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, size=1560, tmp___0=-3, usb_counter=0] [L5966] RET, EXPR ldv_zalloc(1560UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_zalloc(1560UL)={0:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5966] tmp = ldv_zalloc(1560UL) [L5967] cx82310_driver_group1 = (struct usb_interface *)tmp VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, usb_counter=0] [L6218] RET ldv_usb_driver_1() [L6219] return (ldv_func_res); VAL [\result=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, ldv_func_arg1={19:0}, ldv_func_arg1={19:0}, ldv_func_arg2={2147483662:2147483659}, ldv_func_arg2={2147483662:2147483659}, ldv_func_arg3={16:0}, ldv_func_arg3={16:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp=0, usb_counter=0] [L5927] RET, EXPR ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L5927] tmp = ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L5928] return (tmp); VAL [\result=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp=0, usb_counter=0] [L6074] RET, EXPR cx82310_driver_init() [L6074] ldv_retval_4 = cx82310_driver_init() [L6075] COND TRUE ldv_retval_4 == 0 [L6076] ldv_state_variable_0 = 3 [L6077] ldv_state_variable_2 = 1 [L6078] CALL ldv_initialize_driver_info_2() [L5949] void *tmp ; [L5950] void *tmp___0 ; [L5951] void *tmp___1 ; VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5953] CALL, EXPR ldv_zalloc(1472UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); VAL [\old(size)=1472, \result={0:0}, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, size=1472, tmp___0=-4, usb_counter=0] [L5953] RET, EXPR ldv_zalloc(1472UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(1472UL)={0:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5953] tmp = ldv_zalloc(1472UL) [L5954] cx82310_info_group0 = (struct usbnet *)tmp VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, usb_counter=0] [L5955] CALL, EXPR ldv_zalloc(1560UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); VAL [\old(size)=1560, \result={0:0}, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, size=1560, tmp___0=-5, usb_counter=0] [L5955] RET, EXPR ldv_zalloc(1560UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(1560UL)={0:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, usb_counter=0] [L5955] tmp___0 = ldv_zalloc(1560UL) [L5956] cx82310_info_group1 = (struct usb_interface *)tmp___0 VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0={0:0}, usb_counter=0] [L5957] CALL, EXPR ldv_zalloc(232UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, size=232, tmp___0=-6, usb_counter=0] [L5957] RET, EXPR ldv_zalloc(232UL) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(232UL)={0:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0={0:0}, usb_counter=0] [L5957] tmp___1 = ldv_zalloc(232UL) [L5958] cx82310_info_group2 = (struct sk_buff *)tmp___1 VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, usb_counter=0] [L6078] RET ldv_initialize_driver_info_2() [L6081] COND FALSE !(ldv_retval_4 != 0) VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0] [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6096] case 2: VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0=2, tmp___2=1, usb_counter=0] [L6097] COND TRUE ldv_state_variable_2 != 0 [L6098] tmp___3 = __VERIFIER_nondet_int() [L6100] case 0: VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0=2, tmp___2=1, tmp___3=0, usb_counter=0] [L6101] COND TRUE ldv_state_variable_2 == 1 VAL [__mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={21:0}, ldvarg1={0:0}, ldvarg2={22:0}, products={18:0}, ref_cnt=0, set_impl={20:0}, tmp={0:0}, tmp___0=2, tmp___2=1, tmp___3=0, usb_counter=0] [L6102] CALL cx82310_rx_fixup(cx82310_info_group0, cx82310_info_group2) VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=2147483676, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5803] int len ; [L5804] struct sk_buff *skb2 ; [L5805] size_t __len ; [L5806] void *__ret ; [L5807] size_t __len___0 ; [L5808] void *__ret___0 ; [L5809] size_t __len___1 ; [L5810] void *__ret___1 ; [L5811] size_t __len___2 ; [L5812] void *__ret___2 ; [L5814] EXPR dev->data[1] VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, dev->data[1]=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=2147483676, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, usb_counter=0] [L5814] COND FALSE !(dev->data[1] != 0UL) [L5872] EXPR skb->len VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=2147483676, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->len=-4294967297, usb_counter=0] [L5872] COND TRUE skb->len > 1U [L5838] EXPR skb->data [L5838] EXPR skb->data [L5838] EXPR skb->data + 1UL VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=2147483676, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->data=279, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data + 1UL=257, usb_counter=0] [L5838] EXPR (int )*(skb->data + 1UL) << 8 [L5838] EXPR skb->data [L5838] EXPR skb->data + 1UL VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=2147483676, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->data=279, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data + 1UL=257, skb->data + 1UL=257, usb_counter=0] [L5838] EXPR (int )*(skb->data + 1UL) << 8 VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=2147483676, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->data=279, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data + 1UL=257, skb->data + 1UL=257, usb_counter=0] [L5838] len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8) VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=2147483647, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->data=279, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data={2147483656:0}, skb->data + 1UL=257, skb->data + 1UL=257, usb_counter=0] [L5839] CALL skb_pull(skb, 2U) VAL [\old(arg1)=null, \old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, arg0={0:0}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L6465] CALL, EXPR ldv_malloc(sizeof(unsigned char)) VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, \old(size)=1, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L5517] void *p ; [L5518] void *tmp ; [L5519] int tmp___0 ; [L5521] tmp___0 = __VERIFIER_nondet_int() [L5522] COND TRUE tmp___0 != 0 [L5523] return ((void *)0); VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, \old(size)=1, \result={0:0}, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, size=1, tmp___0=-7, usb_counter=0] [L6465] RET, EXPR ldv_malloc(sizeof(unsigned char)) VAL [\old(arg1)=null, \old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, arg0={0:0}, arg0={0:0}, arg1=null, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(unsigned char))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, usb_counter=0] [L6465] return ldv_malloc(sizeof(unsigned char)); [L5839] RET skb_pull(skb, 2U) VAL [\old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=2147483647, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb_pull(skb, 2U)={0:0}, usb_counter=0] [L5840] EXPR skb->len [L5840] (unsigned int )len == skb->len || (unsigned int )(len + 1) == skb->len VAL [(unsigned int )len == skb->len || (unsigned int )(len + 1) == skb->len=0, \old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=2147483647, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->len=-4294967297, usb_counter=0] [L5840] len + 1 VAL [(unsigned int )len == skb->len || (unsigned int )(len + 1) == skb->len=0, \old(last_index)=0, \old(len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8))=2147483676, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __mod_usb__products_device_table=0, __this_module={2147483662:2147483659}, cx82310_driver={19:0}, cx82310_driver_group1={0:0}, cx82310_info={17:0}, cx82310_info_group0={0:0}, cx82310_info_group1={0:0}, cx82310_info_group2={0:0}, dev={0:0}, dev={0:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_retval_5=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, len=2147483647, len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8)=256, products={18:0}, ref_cnt=0, set_impl={20:0}, skb={0:0}, skb={0:0}, skb->len=-4294967297, usb_counter=0] - UnprovableResult [Line: 6257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6261]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6261]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5693]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5693]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5623]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5623]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6003]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6003]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6013]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6013]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6019]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5840]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5870]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5870]: 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 21 procedures, 358 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 91.9s, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 65.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13911 SdHoareTripleChecker+Valid, 46.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13336 mSDsluCounter, 29442 SdHoareTripleChecker+Invalid, 43.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20394 mSDsCounter, 4833 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10464 IncrementalHoareTripleChecker+Invalid, 15297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4833 mSolverCounterUnsat, 9048 mSDtfsCounter, 10464 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 938 GetRequests, 798 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20004occurred in iteration=17, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 52555 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1792 NumberOfCodeBlocks, 1792 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1845 ConstructedInterpolants, 0 QuantifiedInterpolants, 4006 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4001 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 1036/1072 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-16 13:13:44,517 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...