/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--wan--hdlc_cisco.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:12:33,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:12:33,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:12:33,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:12:33,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:12:33,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:12:33,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:12:33,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:12:33,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:12:33,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:12:33,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:12:33,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:12:33,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:12:33,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:12:33,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:12:33,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:12:33,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:12:33,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:12:33,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:12:33,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:12:33,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:12:33,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:12:33,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:12:33,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:12:33,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:12:33,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:12:33,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:12:33,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:12:33,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:12:33,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:12:33,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:12:33,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:12:33,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:12:33,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:12:33,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:12:33,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:12:33,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:12:33,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:12:33,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:12:33,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:12:33,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:12:33,336 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:33,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:12:33,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:12:33,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:12:33,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:12:33,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:12:33,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:12:33,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:12:33,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:12:33,369 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:12:33,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:12:33,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:12:33,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:12:33,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:12:33,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:12:33,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:12:33,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:12:33,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:12:33,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:12:33,371 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:12:33,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:12:33,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:12:33,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:12:33,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:12:33,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:12:33,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:12:33,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:12:33,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:12:33,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:12:33,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:12:33,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:12:33,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:12:33,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:12:33,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:12:33,375 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:33,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:12:33,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:12:33,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:12:33,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:12:33,861 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:12:33,863 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--wan--hdlc_cisco.ko-entry_point.cil.out.i [2022-10-16 13:12:33,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18398078c/feada6212e61402baa6be3d00067af7e/FLAG888937e9a [2022-10-16 13:12:34,986 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:12:34,986 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--wan--hdlc_cisco.ko-entry_point.cil.out.i [2022-10-16 13:12:35,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18398078c/feada6212e61402baa6be3d00067af7e/FLAG888937e9a [2022-10-16 13:12:35,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18398078c/feada6212e61402baa6be3d00067af7e [2022-10-16 13:12:35,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:12:35,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:12:35,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:12:35,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:12:35,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:12:35,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:12:35" (1/1) ... [2022-10-16 13:12:35,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f60484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:35, skipping insertion in model container [2022-10-16 13:12:35,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:12:35" (1/1) ... [2022-10-16 13:12:35,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:12:35,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:12:36,808 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--wan--hdlc_cisco.ko-entry_point.cil.out.i[158033,158046] [2022-10-16 13:12:37,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:12:37,254 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:12:37,449 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--wan--hdlc_cisco.ko-entry_point.cil.out.i[158033,158046] [2022-10-16 13:12:37,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:12:37,771 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:12:37,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:37 WrapperNode [2022-10-16 13:12:37,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:12:37,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:12:37,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:12:37,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:12:37,783 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:37" (1/1) ... [2022-10-16 13:12:37,868 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:37" (1/1) ... [2022-10-16 13:12:38,013 INFO L138 Inliner]: procedures = 146, calls = 357, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1435 [2022-10-16 13:12:38,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:12:38,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:12:38,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:12:38,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:12:38,027 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:37" (1/1) ... [2022-10-16 13:12:38,028 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:37" (1/1) ... [2022-10-16 13:12:38,042 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:37" (1/1) ... [2022-10-16 13:12:38,042 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:37" (1/1) ... [2022-10-16 13:12:38,097 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:37" (1/1) ... [2022-10-16 13:12:38,112 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:37" (1/1) ... [2022-10-16 13:12:38,123 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:37" (1/1) ... [2022-10-16 13:12:38,131 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:37" (1/1) ... [2022-10-16 13:12:38,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:12:38,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:12:38,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:12:38,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:12:38,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:37" (1/1) ... [2022-10-16 13:12:38,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:12:38,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:12:38,214 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:38,240 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:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-10-16 13:12:38,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-10-16 13:12:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 13:12:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-16 13:12:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-16 13:12:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 13:12:38,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 13:12:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:12:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure state [2022-10-16 13:12:38,287 INFO L138 BoogieDeclarations]: Found implementation of procedure state [2022-10-16 13:12:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-10-16 13:12:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-10-16 13:12:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure cisco_ioctl [2022-10-16 13:12:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure cisco_ioctl [2022-10-16 13:12:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure cisco_rx [2022-10-16 13:12:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure cisco_rx [2022-10-16 13:12:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-10-16 13:12:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-10-16 13:12:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure cisco_type_trans [2022-10-16 13:12:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure cisco_type_trans [2022-10-16 13:12:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:12:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:12:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure netif_dormant_on [2022-10-16 13:12:38,290 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_dormant_on [2022-10-16 13:12:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_is_watching [2022-10-16 13:12:38,290 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_is_watching [2022-10-16 13:12:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-10-16 13:12:38,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-10-16 13:12:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:12:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 13:12:38,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 13:12:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 13:12:38,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 13:12:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 13:12:38,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 13:12:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:12:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-10-16 13:12:38,292 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-10-16 13:12:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure cisco_hard_header [2022-10-16 13:12:38,292 INFO L138 BoogieDeclarations]: Found implementation of procedure cisco_hard_header [2022-10-16 13:12:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-10-16 13:12:38,293 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-10-16 13:12:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:12:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:12:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:12:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2022-10-16 13:12:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2022-10-16 13:12:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-10-16 13:12:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-10-16 13:12:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-10-16 13:12:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-10-16 13:12:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-10-16 13:12:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:12:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-10-16 13:12:38,295 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-10-16 13:12:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-10-16 13:12:38,295 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-10-16 13:12:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:12:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:12:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-10-16 13:12:38,296 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-10-16 13:12:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure cisco_keepalive_send [2022-10-16 13:12:38,296 INFO L138 BoogieDeclarations]: Found implementation of procedure cisco_keepalive_send [2022-10-16 13:12:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-10-16 13:12:38,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-10-16 13:12:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-10-16 13:12:38,297 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-10-16 13:12:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-10-16 13:12:38,297 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-10-16 13:12:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-10-16 13:12:38,298 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-10-16 13:12:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 13:12:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-10-16 13:12:38,298 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-10-16 13:12:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-16 13:12:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-16 13:12:38,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-16 13:12:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-10-16 13:12:38,299 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-10-16 13:12:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:12:38,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:12:38,733 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:12:38,738 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:12:39,092 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 13:12:39,913 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:12:39,936 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:12:39,936 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 13:12:39,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:12:39 BoogieIcfgContainer [2022-10-16 13:12:39,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:12:39,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:12:39,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:12:39,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:12:39,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:12:35" (1/3) ... [2022-10-16 13:12:39,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5260c454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:12:39, skipping insertion in model container [2022-10-16 13:12:39,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:12:37" (2/3) ... [2022-10-16 13:12:39,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5260c454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:12:39, skipping insertion in model container [2022-10-16 13:12:39,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:12:39" (3/3) ... [2022-10-16 13:12:39,953 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_cisco.ko-entry_point.cil.out.i [2022-10-16 13:12:39,975 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:12:39,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-10-16 13:12:40,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:12:40,069 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;@f2b4853, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:12:40,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-10-16 13:12:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 370 states have (on average 1.3891891891891892) internal successors, (514), 394 states have internal predecessors, (514), 97 states have call successors, (97), 32 states have call predecessors, (97), 31 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-10-16 13:12:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 13:12:40,096 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:40,097 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __fswab16Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1128050295, now seen corresponding path program 1 times [2022-10-16 13:12:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:40,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123405188] [2022-10-16 13:12:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:12:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-16 13:12:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:40,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123405188] [2022-10-16 13:12:40,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123405188] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:40,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:40,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758809144] [2022-10-16 13:12:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:40,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:40,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:40,829 INFO L87 Difference]: Start difference. First operand has 511 states, 370 states have (on average 1.3891891891891892) internal successors, (514), 394 states have internal predecessors, (514), 97 states have call successors, (97), 32 states have call predecessors, (97), 31 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:12:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:42,602 INFO L93 Difference]: Finished difference Result 1742 states and 2487 transitions. [2022-10-16 13:12:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-10-16 13:12:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:42,634 INFO L225 Difference]: With dead ends: 1742 [2022-10-16 13:12:42,634 INFO L226 Difference]: Without dead ends: 1203 [2022-10-16 13:12:42,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:12:42,653 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 1365 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:42,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 1788 Invalid, 1030 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [354 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-10-16 13:12:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-10-16 13:12:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 945. [2022-10-16 13:12:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 701 states have (on average 1.3666191155492153) internal successors, (958), 722 states have internal predecessors, (958), 176 states have call successors, (176), 60 states have call predecessors, (176), 60 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2022-10-16 13:12:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1310 transitions. [2022-10-16 13:12:42,852 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1310 transitions. Word has length 56 [2022-10-16 13:12:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:42,853 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1310 transitions. [2022-10-16 13:12:42,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:12:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1310 transitions. [2022-10-16 13:12:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 13:12:42,862 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:42,862 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:12:42,863 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:42,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1068559756, now seen corresponding path program 1 times [2022-10-16 13:12:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:42,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15753015] [2022-10-16 13:12:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 13:12:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 13:12:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 13:12:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:12:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 13:12:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 13:12:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-16 13:12:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-16 13:12:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15753015] [2022-10-16 13:12:43,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15753015] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:43,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:43,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193698694] [2022-10-16 13:12:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:43,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:43,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:43,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:43,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:43,174 INFO L87 Difference]: Start difference. First operand 945 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 13:12:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:44,872 INFO L93 Difference]: Finished difference Result 2340 states and 3208 transitions. [2022-10-16 13:12:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:12:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2022-10-16 13:12:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:44,883 INFO L225 Difference]: With dead ends: 2340 [2022-10-16 13:12:44,883 INFO L226 Difference]: Without dead ends: 1409 [2022-10-16 13:12:44,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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:44,889 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 1003 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:44,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 998 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-16 13:12:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-10-16 13:12:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1231. [2022-10-16 13:12:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 918 states have (on average 1.3376906318082789) internal successors, (1228), 943 states have internal predecessors, (1228), 215 states have call successors, (215), 90 states have call predecessors, (215), 90 states have return successors, (215), 215 states have call predecessors, (215), 215 states have call successors, (215) [2022-10-16 13:12:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1658 transitions. [2022-10-16 13:12:45,009 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1658 transitions. Word has length 78 [2022-10-16 13:12:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:45,010 INFO L495 AbstractCegarLoop]: Abstraction has 1231 states and 1658 transitions. [2022-10-16 13:12:45,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 13:12:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1658 transitions. [2022-10-16 13:12:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-16 13:12:45,016 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:45,016 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-10-16 13:12:45,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:12:45,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1436295118, now seen corresponding path program 1 times [2022-10-16 13:12:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:45,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37086888] [2022-10-16 13:12:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:12:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:12:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:12:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:12:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:12:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:12:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-10-16 13:12:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:45,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37086888] [2022-10-16 13:12:45,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37086888] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:45,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:45,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:12:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106933784] [2022-10-16 13:12:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:12:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:12:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:12:45,686 INFO L87 Difference]: Start difference. First operand 1231 states and 1658 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-16 13:12:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:46,677 INFO L93 Difference]: Finished difference Result 2594 states and 3524 transitions. [2022-10-16 13:12:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:12:46,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 84 [2022-10-16 13:12:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:46,693 INFO L225 Difference]: With dead ends: 2594 [2022-10-16 13:12:46,693 INFO L226 Difference]: Without dead ends: 1377 [2022-10-16 13:12:46,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:12:46,708 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 241 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:46,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 2371 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 13:12:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-10-16 13:12:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1247. [2022-10-16 13:12:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 930 states have (on average 1.3333333333333333) internal successors, (1240), 955 states have internal predecessors, (1240), 215 states have call successors, (215), 90 states have call predecessors, (215), 94 states have return successors, (226), 219 states have call predecessors, (226), 215 states have call successors, (226) [2022-10-16 13:12:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1681 transitions. [2022-10-16 13:12:46,848 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1681 transitions. Word has length 84 [2022-10-16 13:12:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:46,852 INFO L495 AbstractCegarLoop]: Abstraction has 1247 states and 1681 transitions. [2022-10-16 13:12:46,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-16 13:12:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1681 transitions. [2022-10-16 13:12:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 13:12:46,858 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:46,859 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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:12:46,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:12:46,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2028280460, now seen corresponding path program 1 times [2022-10-16 13:12:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:46,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603247684] [2022-10-16 13:12:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:12:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:12:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:12:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:12:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:12:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:12:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:12:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 13:12:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:47,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603247684] [2022-10-16 13:12:47,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603247684] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:47,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:47,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:12:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917792669] [2022-10-16 13:12:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:47,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:12:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:12:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:12:47,335 INFO L87 Difference]: Start difference. First operand 1247 states and 1681 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 13:12:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:48,550 INFO L93 Difference]: Finished difference Result 3955 states and 5379 transitions. [2022-10-16 13:12:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:12:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2022-10-16 13:12:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:48,568 INFO L225 Difference]: With dead ends: 3955 [2022-10-16 13:12:48,569 INFO L226 Difference]: Without dead ends: 2722 [2022-10-16 13:12:48,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:48,576 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 1081 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:48,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1537 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 13:12:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2022-10-16 13:12:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2566. [2022-10-16 13:12:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1927 states have (on average 1.3341982355993773) internal successors, (2571), 1976 states have internal predecessors, (2571), 433 states have call successors, (433), 180 states have call predecessors, (433), 198 states have return successors, (478), 447 states have call predecessors, (478), 433 states have call successors, (478) [2022-10-16 13:12:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3482 transitions. [2022-10-16 13:12:48,792 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3482 transitions. Word has length 91 [2022-10-16 13:12:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:48,793 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 3482 transitions. [2022-10-16 13:12:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 13:12:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3482 transitions. [2022-10-16 13:12:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 13:12:48,796 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:48,797 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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:12:48,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:12:48,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:48,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1547740874, now seen corresponding path program 1 times [2022-10-16 13:12:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:48,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190813723] [2022-10-16 13:12:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:12:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:12:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:12:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:12:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:12:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:12:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:12:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 13:12:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:49,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190813723] [2022-10-16 13:12:49,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190813723] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:49,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:49,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085917887] [2022-10-16 13:12:49,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:49,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:49,213 INFO L87 Difference]: Start difference. First operand 2566 states and 3482 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 13:12:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:50,732 INFO L93 Difference]: Finished difference Result 5252 states and 7150 transitions. [2022-10-16 13:12:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:12:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2022-10-16 13:12:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:50,753 INFO L225 Difference]: With dead ends: 5252 [2022-10-16 13:12:50,754 INFO L226 Difference]: Without dead ends: 2700 [2022-10-16 13:12:50,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:12:50,766 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1079 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:50,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1914 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-16 13:12:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-10-16 13:12:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2546. [2022-10-16 13:12:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1907 states have (on average 1.3293130571578395) internal successors, (2535), 1956 states have internal predecessors, (2535), 433 states have call successors, (433), 180 states have call predecessors, (433), 198 states have return successors, (478), 447 states have call predecessors, (478), 433 states have call successors, (478) [2022-10-16 13:12:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3446 transitions. [2022-10-16 13:12:51,017 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3446 transitions. Word has length 92 [2022-10-16 13:12:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:51,018 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3446 transitions. [2022-10-16 13:12:51,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 13:12:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3446 transitions. [2022-10-16 13:12:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-16 13:12:51,029 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:51,029 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:51,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:12:51,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash -193367446, now seen corresponding path program 1 times [2022-10-16 13:12:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:51,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617668179] [2022-10-16 13:12:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:12:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:12:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 13:12:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:12:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:12:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:12:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:12:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 13:12:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 13:12:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-10-16 13:12:51,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:51,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617668179] [2022-10-16 13:12:51,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617668179] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:51,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:51,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:12:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308977426] [2022-10-16 13:12:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:51,324 INFO L87 Difference]: Start difference. First operand 2546 states and 3446 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-16 13:12:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:53,627 INFO L93 Difference]: Finished difference Result 5378 states and 7296 transitions. [2022-10-16 13:12:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:12:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2022-10-16 13:12:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:53,668 INFO L225 Difference]: With dead ends: 5378 [2022-10-16 13:12:53,669 INFO L226 Difference]: Without dead ends: 5374 [2022-10-16 13:12:53,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:12:53,675 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 1850 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:53,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 988 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-10-16 13:12:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2022-10-16 13:12:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 5070. [2022-10-16 13:12:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5070 states, 3805 states have (on average 1.325886990801577) internal successors, (5045), 3896 states have internal predecessors, (5045), 861 states have call successors, (861), 360 states have call predecessors, (861), 396 states have return successors, (946), 889 states have call predecessors, (946), 861 states have call successors, (946) [2022-10-16 13:12:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 6852 transitions. [2022-10-16 13:12:54,086 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 6852 transitions. Word has length 102 [2022-10-16 13:12:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:54,087 INFO L495 AbstractCegarLoop]: Abstraction has 5070 states and 6852 transitions. [2022-10-16 13:12:54,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-16 13:12:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 6852 transitions. [2022-10-16 13:12:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-10-16 13:12:54,100 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:54,100 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:12:54,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:12:54,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash -58245320, now seen corresponding path program 1 times [2022-10-16 13:12:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:54,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475200827] [2022-10-16 13:12:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:12:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:12:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 13:12:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:12:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:12:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:12:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:12:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 13:12:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 13:12:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 13:12:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:12:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-16 13:12:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 13:12:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-10-16 13:12:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:12:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 13:12:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-10-16 13:12:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:54,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475200827] [2022-10-16 13:12:54,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475200827] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:12:54,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140390831] [2022-10-16 13:12:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:54,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:12:54,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:12:54,651 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:54,676 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:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:54,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 13:12:54,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:12:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-10-16 13:12:55,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:12:55,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140390831] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:55,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:12:55,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-16 13:12:55,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300349426] [2022-10-16 13:12:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:55,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 13:12:55,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:55,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 13:12:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:12:55,043 INFO L87 Difference]: Start difference. First operand 5070 states and 6852 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-10-16 13:12:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:55,730 INFO L93 Difference]: Finished difference Result 13590 states and 18488 transitions. [2022-10-16 13:12:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 13:12:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 147 [2022-10-16 13:12:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:55,793 INFO L225 Difference]: With dead ends: 13590 [2022-10-16 13:12:55,793 INFO L226 Difference]: Without dead ends: 8534 [2022-10-16 13:12:55,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:12:55,813 INFO L413 NwaCegarLoop]: 935 mSDtfsCounter, 590 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:55,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1547 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:12:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8534 states. [2022-10-16 13:12:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8534 to 8530. [2022-10-16 13:12:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8530 states, 6473 states have (on average 1.3441989803800403) internal successors, (8701), 6628 states have internal predecessors, (8701), 1401 states have call successors, (1401), 592 states have call predecessors, (1401), 648 states have return successors, (1518), 1445 states have call predecessors, (1518), 1401 states have call successors, (1518) [2022-10-16 13:12:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8530 states to 8530 states and 11620 transitions. [2022-10-16 13:12:56,555 INFO L78 Accepts]: Start accepts. Automaton has 8530 states and 11620 transitions. Word has length 147 [2022-10-16 13:12:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:12:56,556 INFO L495 AbstractCegarLoop]: Abstraction has 8530 states and 11620 transitions. [2022-10-16 13:12:56,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-10-16 13:12:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8530 states and 11620 transitions. [2022-10-16 13:12:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-16 13:12:56,573 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:12:56,573 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 13:12:56,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:12:56,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:12:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:12:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2082102268, now seen corresponding path program 1 times [2022-10-16 13:12:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:12:56,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794962454] [2022-10-16 13:12:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:12:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:12:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:12:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:12:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:12:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:12:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:12:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:12:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:12:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:12:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 13:12:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 13:12:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 13:12:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 13:12:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:12:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 13:12:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-16 13:12:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 13:12:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-10-16 13:12:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:12:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 13:12:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-10-16 13:12:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:12:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-10-16 13:12:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:12:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794962454] [2022-10-16 13:12:57,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794962454] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:12:57,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:12:57,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:12:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148650183] [2022-10-16 13:12:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:12:57,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:12:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:12:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:12:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:12:57,102 INFO L87 Difference]: Start difference. First operand 8530 states and 11620 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-10-16 13:12:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:12:59,625 INFO L93 Difference]: Finished difference Result 14695 states and 20144 transitions. [2022-10-16 13:12:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:12:59,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 152 [2022-10-16 13:12:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:12:59,664 INFO L225 Difference]: With dead ends: 14695 [2022-10-16 13:12:59,664 INFO L226 Difference]: Without dead ends: 6179 [2022-10-16 13:12:59,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:12:59,688 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1724 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:12:59,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 1102 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-10-16 13:12:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-10-16 13:13:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5810. [2022-10-16 13:13:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5810 states, 4405 states have (on average 1.343700340522134) internal successors, (5919), 4513 states have internal predecessors, (5919), 977 states have call successors, (977), 386 states have call predecessors, (977), 420 states have return successors, (1056), 1004 states have call predecessors, (1056), 977 states have call successors, (1056) [2022-10-16 13:13:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5810 states to 5810 states and 7952 transitions. [2022-10-16 13:13:00,233 INFO L78 Accepts]: Start accepts. Automaton has 5810 states and 7952 transitions. Word has length 152 [2022-10-16 13:13:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:00,234 INFO L495 AbstractCegarLoop]: Abstraction has 5810 states and 7952 transitions. [2022-10-16 13:13:00,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-10-16 13:13:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5810 states and 7952 transitions. [2022-10-16 13:13:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-16 13:13:00,245 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:00,245 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 13:13:00,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1990809207, now seen corresponding path program 1 times [2022-10-16 13:13:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404413663] [2022-10-16 13:13:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:13:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:13:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 13:13:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:13:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:13:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:13:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:13:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 13:13:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 13:13:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 13:13:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-16 13:13:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 13:13:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 13:13:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-10-16 13:13:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 13:13:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-16 13:13:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404413663] [2022-10-16 13:13:00,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404413663] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577905866] [2022-10-16 13:13:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:00,667 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:13:00,695 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:13:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:00,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:13:00,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 13:13:01,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:13:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-16 13:13:01,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577905866] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:13:01,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:13:01,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-16 13:13:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913624607] [2022-10-16 13:13:01,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:13:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 13:13:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 13:13:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:13:01,333 INFO L87 Difference]: Start difference. First operand 5810 states and 7952 transitions. Second operand has 9 states, 8 states have (on average 24.25) internal successors, (194), 7 states have internal predecessors, (194), 6 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (50), 6 states have call predecessors, (50), 6 states have call successors, (50) [2022-10-16 13:13:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:08,726 INFO L93 Difference]: Finished difference Result 15929 states and 21962 transitions. [2022-10-16 13:13:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:13:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 24.25) internal successors, (194), 7 states have internal predecessors, (194), 6 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (50), 6 states have call predecessors, (50), 6 states have call successors, (50) Word has length 152 [2022-10-16 13:13:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:08,812 INFO L225 Difference]: With dead ends: 15929 [2022-10-16 13:13:08,813 INFO L226 Difference]: Without dead ends: 15927 [2022-10-16 13:13:08,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2022-10-16 13:13:08,821 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 6206 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 3425 mSolverCounterSat, 2287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 5712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2287 IncrementalHoareTripleChecker+Valid, 3425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:08,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 1319 Invalid, 5712 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2287 Valid, 3425 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-10-16 13:13:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2022-10-16 13:13:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 11303. [2022-10-16 13:13:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11303 states, 8579 states have (on average 1.3464273225317636) internal successors, (11551), 8782 states have internal predecessors, (11551), 1911 states have call successors, (1911), 742 states have call predecessors, (1911), 806 states have return successors, (2058), 1962 states have call predecessors, (2058), 1911 states have call successors, (2058) [2022-10-16 13:13:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11303 states to 11303 states and 15520 transitions. [2022-10-16 13:13:09,875 INFO L78 Accepts]: Start accepts. Automaton has 11303 states and 15520 transitions. Word has length 152 [2022-10-16 13:13:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:09,876 INFO L495 AbstractCegarLoop]: Abstraction has 11303 states and 15520 transitions. [2022-10-16 13:13:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 24.25) internal successors, (194), 7 states have internal predecessors, (194), 6 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (50), 6 states have call predecessors, (50), 6 states have call successors, (50) [2022-10-16 13:13:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 11303 states and 15520 transitions. [2022-10-16 13:13:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-10-16 13:13:09,888 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:09,888 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-16 13:13:10,102 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:13:10,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1585542236, now seen corresponding path program 1 times [2022-10-16 13:13:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:10,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479260896] [2022-10-16 13:13:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:13:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:13:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 13:13:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:13:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:13:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:13:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:13:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 13:13:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 13:13:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 13:13:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-16 13:13:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 13:13:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 13:13:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-10-16 13:13:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 13:13:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-16 13:13:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:10,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479260896] [2022-10-16 13:13:10,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479260896] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:10,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053503050] [2022-10-16 13:13:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:10,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:10,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:10,484 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:10,510 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:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:10,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:13:10,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-16 13:13:10,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:10,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053503050] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:10,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:10,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-16 13:13:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669679482] [2022-10-16 13:13:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:10,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:13:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:13:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:13:10,982 INFO L87 Difference]: Start difference. First operand 11303 states and 15520 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-10-16 13:13:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:12,254 INFO L93 Difference]: Finished difference Result 13143 states and 18050 transitions. [2022-10-16 13:13:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:13:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2022-10-16 13:13:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:12,316 INFO L225 Difference]: With dead ends: 13143 [2022-10-16 13:13:12,316 INFO L226 Difference]: Without dead ends: 13141 [2022-10-16 13:13:12,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 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:13:12,326 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 1185 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:12,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 1724 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 13:13:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13141 states. [2022-10-16 13:13:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13141 to 9465. [2022-10-16 13:13:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9465 states, 7187 states have (on average 1.3447892027271462) internal successors, (9665), 7356 states have internal predecessors, (9665), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 676 states have return successors, (1720), 1640 states have call predecessors, (1720), 1597 states have call successors, (1720) [2022-10-16 13:13:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9465 states to 9465 states and 12982 transitions. [2022-10-16 13:13:13,229 INFO L78 Accepts]: Start accepts. Automaton has 9465 states and 12982 transitions. Word has length 153 [2022-10-16 13:13:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:13,230 INFO L495 AbstractCegarLoop]: Abstraction has 9465 states and 12982 transitions. [2022-10-16 13:13:13,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-10-16 13:13:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9465 states and 12982 transitions. [2022-10-16 13:13:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-10-16 13:13:13,246 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:13,246 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:13,289 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:13,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:13,460 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash 66579469, now seen corresponding path program 1 times [2022-10-16 13:13:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:13,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921636427] [2022-10-16 13:13:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:13:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:13:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:13:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 13:13:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:13:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 13:13:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 13:13:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:13:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 13:13:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 13:13:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-16 13:13:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921636427] [2022-10-16 13:13:13,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921636427] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:13,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994816404] [2022-10-16 13:13:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:13,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:13,916 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:13,942 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:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:14,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 13:13:14,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-10-16 13:13:14,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:14,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994816404] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:14,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:14,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2022-10-16 13:13:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723425372] [2022-10-16 13:13:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:14,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 13:13:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:14,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 13:13:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:13:14,406 INFO L87 Difference]: Start difference. First operand 9465 states and 12982 transitions. Second operand has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:15,307 INFO L93 Difference]: Finished difference Result 9466 states and 12982 transitions. [2022-10-16 13:13:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 13:13:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 170 [2022-10-16 13:13:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:15,349 INFO L225 Difference]: With dead ends: 9466 [2022-10-16 13:13:15,349 INFO L226 Difference]: Without dead ends: 9465 [2022-10-16 13:13:15,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:13:15,356 INFO L413 NwaCegarLoop]: 759 mSDtfsCounter, 655 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:15,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:13:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9465 states. [2022-10-16 13:13:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9465 to 9464. [2022-10-16 13:13:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9464 states, 7187 states have (on average 1.3432586614721025) internal successors, (9654), 7355 states have internal predecessors, (9654), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 676 states have return successors, (1720), 1640 states have call predecessors, (1720), 1597 states have call successors, (1720) [2022-10-16 13:13:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9464 states to 9464 states and 12971 transitions. [2022-10-16 13:13:16,303 INFO L78 Accepts]: Start accepts. Automaton has 9464 states and 12971 transitions. Word has length 170 [2022-10-16 13:13:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:16,310 INFO L495 AbstractCegarLoop]: Abstraction has 9464 states and 12971 transitions. [2022-10-16 13:13:16,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9464 states and 12971 transitions. [2022-10-16 13:13:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-10-16 13:13:16,324 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:16,325 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:16,372 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:16,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:16,538 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 9 more)] === [2022-10-16 13:13:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2063889233, now seen corresponding path program 1 times [2022-10-16 13:13:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:16,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846526841] [2022-10-16 13:13:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:16,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:13:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:13:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:13:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 13:13:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:13:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 13:13:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 13:13:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:13:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 13:13:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 13:13:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-10-16 13:13:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:16,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846526841] [2022-10-16 13:13:16,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846526841] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61655487] [2022-10-16 13:13:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:16,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:16,902 INFO L229 MonitoredProcess]: Starting monitored process 6 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:16,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 13:13:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:17,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 13:13:17,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-10-16 13:13:17,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:17,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61655487] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:17,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 13:13:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758469140] [2022-10-16 13:13:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:17,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 13:13:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 13:13:17,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:17,278 INFO L87 Difference]: Start difference. First operand 9464 states and 12971 transitions. Second operand has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:18,067 INFO L93 Difference]: Finished difference Result 9598 states and 13169 transitions. [2022-10-16 13:13:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 13:13:18,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 171 [2022-10-16 13:13:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:18,115 INFO L225 Difference]: With dead ends: 9598 [2022-10-16 13:13:18,116 INFO L226 Difference]: Without dead ends: 9597 [2022-10-16 13:13:18,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:18,124 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 11 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:18,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:13:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9597 states. [2022-10-16 13:13:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9597 to 9585. [2022-10-16 13:13:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9585 states, 7297 states have (on average 1.344114019460052) internal successors, (9808), 7476 states have internal predecessors, (9808), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 687 states have return successors, (1731), 1640 states have call predecessors, (1731), 1597 states have call successors, (1731) [2022-10-16 13:13:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 13136 transitions. [2022-10-16 13:13:19,089 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 13136 transitions. Word has length 171 [2022-10-16 13:13:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:19,090 INFO L495 AbstractCegarLoop]: Abstraction has 9585 states and 13136 transitions. [2022-10-16 13:13:19,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 13136 transitions. [2022-10-16 13:13:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-10-16 13:13:19,105 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:19,105 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:19,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:19,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-16 13:13:19,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_skb_allocErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2063963614, now seen corresponding path program 1 times [2022-10-16 13:13:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986624246] [2022-10-16 13:13:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:13:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:13:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:13:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 13:13:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:13:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 13:13:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 13:13:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:13:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 13:13:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 13:13:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-10-16 13:13:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986624246] [2022-10-16 13:13:20,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986624246] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:20,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385607497] [2022-10-16 13:13:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:20,177 INFO L229 MonitoredProcess]: Starting monitored process 7 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:20,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 13:13:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:20,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 13:13:20,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-10-16 13:13:20,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:20,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385607497] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:20,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:20,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-10-16 13:13:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304089242] [2022-10-16 13:13:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:20,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 13:13:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:20,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 13:13:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:13:20,667 INFO L87 Difference]: Start difference. First operand 9585 states and 13136 transitions. Second operand has 3 states, 2 states have (on average 51.5) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-10-16 13:13:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:21,416 INFO L93 Difference]: Finished difference Result 9585 states and 13136 transitions. [2022-10-16 13:13:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 13:13:21,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 51.5) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2022-10-16 13:13:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:21,456 INFO L225 Difference]: With dead ends: 9585 [2022-10-16 13:13:21,457 INFO L226 Difference]: Without dead ends: 9584 [2022-10-16 13:13:21,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:13:21,464 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:21,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 662 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:13:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2022-10-16 13:13:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 9562. [2022-10-16 13:13:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9562 states, 7275 states have (on average 1.3421305841924398) internal successors, (9764), 7453 states have internal predecessors, (9764), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 687 states have return successors, (1731), 1640 states have call predecessors, (1731), 1597 states have call successors, (1731) [2022-10-16 13:13:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9562 states to 9562 states and 13092 transitions. [2022-10-16 13:13:22,391 INFO L78 Accepts]: Start accepts. Automaton has 9562 states and 13092 transitions. Word has length 171 [2022-10-16 13:13:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:22,392 INFO L495 AbstractCegarLoop]: Abstraction has 9562 states and 13092 transitions. [2022-10-16 13:13:22,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 51.5) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-10-16 13:13:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 9562 states and 13092 transitions. [2022-10-16 13:13:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-10-16 13:13:22,406 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:22,406 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:22,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:22,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:22,620 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -443943152, now seen corresponding path program 1 times [2022-10-16 13:13:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:22,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325830253] [2022-10-16 13:13:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:13:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:13:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:13:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 13:13:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:13:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 13:13:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 13:13:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:13:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 13:13:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:22,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 13:13:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-10-16 13:13:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325830253] [2022-10-16 13:13:23,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325830253] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869369791] [2022-10-16 13:13:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:23,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:23,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:23,011 INFO L229 MonitoredProcess]: Starting monitored process 8 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:23,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 13:13:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:23,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 13:13:23,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-10-16 13:13:23,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:13:23,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869369791] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:23,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:13:23,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 13:13:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716026550] [2022-10-16 13:13:23,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:23,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 13:13:23,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 13:13:23,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:23,398 INFO L87 Difference]: Start difference. First operand 9562 states and 13092 transitions. Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:24,233 INFO L93 Difference]: Finished difference Result 9584 states and 13114 transitions. [2022-10-16 13:13:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 13:13:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 172 [2022-10-16 13:13:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:24,282 INFO L225 Difference]: With dead ends: 9584 [2022-10-16 13:13:24,282 INFO L226 Difference]: Without dead ends: 9583 [2022-10-16 13:13:24,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:13:24,290 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 9 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:24,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1316 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:13:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9583 states. [2022-10-16 13:13:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9583 to 9561. [2022-10-16 13:13:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9561 states, 7275 states have (on average 1.340618556701031) internal successors, (9753), 7452 states have internal predecessors, (9753), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 687 states have return successors, (1731), 1640 states have call predecessors, (1731), 1597 states have call successors, (1731) [2022-10-16 13:13:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9561 states to 9561 states and 13081 transitions. [2022-10-16 13:13:25,306 INFO L78 Accepts]: Start accepts. Automaton has 9561 states and 13081 transitions. Word has length 172 [2022-10-16 13:13:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:25,306 INFO L495 AbstractCegarLoop]: Abstraction has 9561 states and 13081 transitions. [2022-10-16 13:13:25,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9561 states and 13081 transitions. [2022-10-16 13:13:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-10-16 13:13:25,318 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:25,318 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:25,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:25,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1020203065, now seen corresponding path program 1 times [2022-10-16 13:13:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:25,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567286896] [2022-10-16 13:13:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:13:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:13:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:13:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 13:13:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:13:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 13:13:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 13:13:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:13:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 13:13:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 13:13:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-10-16 13:13:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:25,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567286896] [2022-10-16 13:13:25,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567286896] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:25,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264666149] [2022-10-16 13:13:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:25,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:25,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:25,915 INFO L229 MonitoredProcess]: Starting monitored process 9 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:25,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 13:13:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:26,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 13:13:26,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-10-16 13:13:26,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:13:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-10-16 13:13:26,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264666149] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:13:26,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:13:26,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-16 13:13:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39101093] [2022-10-16 13:13:26,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:13:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 13:13:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 13:13:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:13:26,427 INFO L87 Difference]: Start difference. First operand 9561 states and 13081 transitions. Second operand has 9 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:28,274 INFO L93 Difference]: Finished difference Result 10555 states and 14469 transitions. [2022-10-16 13:13:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:13:28,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 177 [2022-10-16 13:13:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:28,318 INFO L225 Difference]: With dead ends: 10555 [2022-10-16 13:13:28,318 INFO L226 Difference]: Without dead ends: 10554 [2022-10-16 13:13:28,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:13:28,326 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 530 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:28,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1830 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 13:13:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2022-10-16 13:13:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 9759. [2022-10-16 13:13:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9759 states, 7473 states have (on average 1.3404255319148937) internal successors, (10017), 7650 states have internal predecessors, (10017), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 687 states have return successors, (1731), 1640 states have call predecessors, (1731), 1597 states have call successors, (1731) [2022-10-16 13:13:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9759 states to 9759 states and 13345 transitions. [2022-10-16 13:13:29,411 INFO L78 Accepts]: Start accepts. Automaton has 9759 states and 13345 transitions. Word has length 177 [2022-10-16 13:13:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:29,412 INFO L495 AbstractCegarLoop]: Abstraction has 9759 states and 13345 transitions. [2022-10-16 13:13:29,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-10-16 13:13:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9759 states and 13345 transitions. [2022-10-16 13:13:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-10-16 13:13:29,424 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:29,424 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:13:29,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:29,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 13:13:29,631 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1475723817, now seen corresponding path program 2 times [2022-10-16 13:13:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:29,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794012255] [2022-10-16 13:13:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-16 13:13:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 13:13:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 13:13:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 13:13:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 13:13:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 13:13:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 13:13:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 13:13:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 13:13:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 13:13:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 13:13:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-10-16 13:13:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 13:13:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 13:13:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-16 13:13:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 13:13:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 10 proven. 58 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-10-16 13:13:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:30,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794012255] [2022-10-16 13:13:30,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794012255] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:13:30,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797292687] [2022-10-16 13:13:30,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 13:13:30,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:13:30,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:13:30,183 INFO L229 MonitoredProcess]: Starting monitored process 10 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,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 13:13:30,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 13:13:30,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 13:13:30,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 13:13:30,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:13:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 91 proven. 12 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-10-16 13:13:30,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:13:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-10-16 13:13:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797292687] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:13:31,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:13:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2022-10-16 13:13:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053548011] [2022-10-16 13:13:31,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:13:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 13:13:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 13:13:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-10-16 13:13:31,017 INFO L87 Difference]: Start difference. First operand 9759 states and 13345 transitions. Second operand has 15 states, 14 states have (on average 14.071428571428571) internal successors, (197), 13 states have internal predecessors, (197), 3 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-10-16 13:13:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:34,514 INFO L93 Difference]: Finished difference Result 16082 states and 22031 transitions. [2022-10-16 13:13:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 13:13:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 14.071428571428571) internal successors, (197), 13 states have internal predecessors, (197), 3 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 195 [2022-10-16 13:13:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:34,571 INFO L225 Difference]: With dead ends: 16082 [2022-10-16 13:13:34,572 INFO L226 Difference]: Without dead ends: 10807 [2022-10-16 13:13:34,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2022-10-16 13:13:34,600 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 2322 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:34,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 2955 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-10-16 13:13:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10807 states. [2022-10-16 13:13:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10807 to 9857. [2022-10-16 13:13:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9857 states, 7572 states have (on average 1.3374273639725305) internal successors, (10127), 7748 states have internal predecessors, (10127), 1597 states have call successors, (1597), 622 states have call predecessors, (1597), 687 states have return successors, (1731), 1640 states have call predecessors, (1731), 1597 states have call successors, (1731) [2022-10-16 13:13:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9857 states to 9857 states and 13455 transitions. [2022-10-16 13:13:35,792 INFO L78 Accepts]: Start accepts. Automaton has 9857 states and 13455 transitions. Word has length 195 [2022-10-16 13:13:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:35,793 INFO L495 AbstractCegarLoop]: Abstraction has 9857 states and 13455 transitions. [2022-10-16 13:13:35,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 14.071428571428571) internal successors, (197), 13 states have internal predecessors, (197), 3 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-10-16 13:13:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9857 states and 13455 transitions. [2022-10-16 13:13:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-10-16 13:13:35,812 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:13:35,813 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:35,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 13:13:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 13:13:36,014 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 13:13:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:13:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 834104554, now seen corresponding path program 2 times [2022-10-16 13:13:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:13:36,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108913282] [2022-10-16 13:13:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:13:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:13:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:13:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:13:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:13:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 13:13:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-16 13:13:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 13:13:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 13:13:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 13:13:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:13:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:13:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:13:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:13:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 13:13:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 13:13:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 13:13:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-16 13:13:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 13:13:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 13:13:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 13:13:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-10-16 13:13:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-10-16 13:13:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 13:13:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-10-16 13:13:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-10-16 13:13:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-16 13:13:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-10-16 13:13:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-10-16 13:13:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-10-16 13:13:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-10-16 13:13:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-10-16 13:13:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-10-16 13:13:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-10-16 13:13:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:13:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-10-16 13:13:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:13:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108913282] [2022-10-16 13:13:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108913282] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:13:36,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:13:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:13:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898628069] [2022-10-16 13:13:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:13:36,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:13:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:13:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:13:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:13:36,440 INFO L87 Difference]: Start difference. First operand 9857 states and 13455 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-10-16 13:13:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:13:38,157 INFO L93 Difference]: Finished difference Result 13882 states and 18991 transitions. [2022-10-16 13:13:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:13:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 240 [2022-10-16 13:13:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:13:38,159 INFO L225 Difference]: With dead ends: 13882 [2022-10-16 13:13:38,160 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 13:13:38,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:13:38,198 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 1228 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:13:38,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 1033 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-16 13:13:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 13:13:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 13:13:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:13:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 13:13:38,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2022-10-16 13:13:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:13:38,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 13:13:38,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-10-16 13:13:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 13:13:38,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 13:13:38,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-10-16 13:13:38,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-10-16 13:13:38,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-10-16 13:13:38,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_skb_allocErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-10-16 13:13:38,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location cisco_keepalive_sendErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-10-16 13:13:38,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location cisco_keepalive_sendErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-10-16 13:13:38,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __fswab16Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-10-16 13:13:38,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __fswab16Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-10-16 13:13:38,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-10-16 13:13:38,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-10-16 13:13:38,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-10-16 13:13:38,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-10-16 13:13:38,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 13:13:38,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 13:16:02,325 INFO L899 garLoopResultBuilder]: For program point __fswab32FINAL(lines 5126 5133) no Hoare annotation was computed. [2022-10-16 13:16:02,325 INFO L899 garLoopResultBuilder]: For program point __fswab32EXIT(lines 5126 5133) no Hoare annotation was computed. [2022-10-16 13:16:02,325 INFO L902 garLoopResultBuilder]: At program point L5117(lines 5113 5119) the Hoare annotation is: true [2022-10-16 13:16:02,326 INFO L902 garLoopResultBuilder]: At program point __fswab32ENTRY(lines 5126 5133) the Hoare annotation is: true [2022-10-16 13:16:02,326 INFO L899 garLoopResultBuilder]: For program point L6400-1(line 6400) no Hoare annotation was computed. [2022-10-16 13:16:02,326 INFO L899 garLoopResultBuilder]: For program point L6400(line 6400) no Hoare annotation was computed. [2022-10-16 13:16:02,326 INFO L895 garLoopResultBuilder]: At program point L6402-1(lines 6386 6409) the Hoare annotation is: (let ((.cse1 (not (<= 1 ~ref_cnt~0))) (.cse4 (not (<= 2 ~ldv_state_variable_3~0))) (.cse6 (not (<= ~ref_cnt~0 1))) (.cse0 (not (<= |old(~last_index~0)| 15))) (.cse2 (and (<= ~last_index~0 15) (<= |ldv_skb_alloc_ldv_set_add_~i~0#1| 2147483646) (<= 0 |ldv_skb_alloc_ldv_set_add_~i~0#1|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse3 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse11 (not (= ~ldv_state_variable_2~0 0))) (.cse12 (not (= ~ldv_state_variable_3~0 0))) (.cse8 (not (= ~ref_cnt~0 0))) (.cse9 (= |ldv_skb_alloc_ldv_set_add_~i~0#1| 0)) (.cse10 (not (= |old(~last_index~0)| 0))) (.cse5 (not (= ~ldv_state_variable_0~0 3))) (.cse7 (not (= ~ldv_state_variable_3~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse3 (not (<= 0 ~ref_cnt~0)) .cse5 .cse7 (not (<= ~ref_cnt~0 0))) (or .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse9 .cse10 .cse4 .cse5 .cse6) (or .cse0 .cse8 .cse2 .cse3 .cse11 .cse12) (or .cse8 .cse9 .cse10 .cse5 .cse7))) [2022-10-16 13:16:02,327 INFO L899 garLoopResultBuilder]: For program point L6396(lines 6396 6399) no Hoare annotation was computed. [2022-10-16 13:16:02,327 INFO L899 garLoopResultBuilder]: For program point ldv_skb_allocEXIT(lines 6510 6524) no Hoare annotation was computed. [2022-10-16 13:16:02,327 INFO L899 garLoopResultBuilder]: For program point L6392-1(lines 6392 6395) no Hoare annotation was computed. [2022-10-16 13:16:02,327 INFO L899 garLoopResultBuilder]: For program point ldv_skb_allocErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6404) no Hoare annotation was computed. [2022-10-16 13:16:02,327 INFO L899 garLoopResultBuilder]: For program point L6392(lines 6392 6395) no Hoare annotation was computed. [2022-10-16 13:16:02,328 INFO L899 garLoopResultBuilder]: For program point ldv_skb_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6400) no Hoare annotation was computed. [2022-10-16 13:16:02,328 INFO L899 garLoopResultBuilder]: For program point ldv_skb_allocFINAL(lines 6510 6524) no Hoare annotation was computed. [2022-10-16 13:16:02,328 INFO L895 garLoopResultBuilder]: At program point ldv_skb_allocENTRY(lines 6510 6524) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 (not (= ~ref_cnt~0 0)) .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,329 INFO L899 garLoopResultBuilder]: For program point ldv_skb_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6404) no Hoare annotation was computed. [2022-10-16 13:16:02,329 INFO L899 garLoopResultBuilder]: For program point L6515-1(line 6515) no Hoare annotation was computed. [2022-10-16 13:16:02,329 INFO L895 garLoopResultBuilder]: At program point L6515(line 6515) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 (not (= ~ref_cnt~0 0)) .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,333 INFO L899 garLoopResultBuilder]: For program point L6391-3(lines 6389 6408) no Hoare annotation was computed. [2022-10-16 13:16:02,333 INFO L899 garLoopResultBuilder]: For program point L6517(lines 6517 6522) no Hoare annotation was computed. [2022-10-16 13:16:02,334 INFO L899 garLoopResultBuilder]: For program point ldv_skb_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6400) no Hoare annotation was computed. [2022-10-16 13:16:02,334 INFO L895 garLoopResultBuilder]: At program point L6391-2(lines 6391 6401) the Hoare annotation is: (let ((.cse1 (not (<= 1 ~ref_cnt~0))) (.cse4 (not (<= 2 ~ldv_state_variable_3~0))) (.cse6 (not (<= ~ref_cnt~0 1))) (.cse5 (not (= ~ldv_state_variable_0~0 3))) (.cse7 (not (= ~ldv_state_variable_3~0 1))) (.cse0 (not (<= |old(~last_index~0)| 15))) (.cse2 (and (<= ~last_index~0 15) (<= |ldv_skb_alloc_ldv_set_add_~i~0#1| 2147483646) (<= 0 |ldv_skb_alloc_ldv_set_add_~i~0#1|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse3 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse8 (and (= |ldv_skb_alloc_ldv_set_add_~i~0#1| 0) (= ~last_index~0 0))) (.cse10 (not (= ~ref_cnt~0 0))) (.cse9 (not (= |old(~last_index~0)| 0))) (.cse11 (not (= ~ldv_state_variable_2~0 0))) (.cse12 (not (= ~ldv_state_variable_3~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse3 (not (<= 0 ~ref_cnt~0)) .cse5 .cse7 (not (<= ~ref_cnt~0 0))) (or .cse8 .cse1 .cse9 .cse4 .cse5 .cse6) (or .cse8 .cse10 .cse9 .cse5 .cse7) (or .cse0 .cse10 .cse2 .cse3 .cse11 .cse12) (or .cse8 .cse10 .cse9 .cse11 .cse12))) [2022-10-16 13:16:02,334 INFO L899 garLoopResultBuilder]: For program point L6404-1(line 6404) no Hoare annotation was computed. [2022-10-16 13:16:02,334 INFO L899 garLoopResultBuilder]: For program point L6404(line 6404) no Hoare annotation was computed. [2022-10-16 13:16:02,334 INFO L902 garLoopResultBuilder]: At program point might_faultFINAL(lines 6661 6663) the Hoare annotation is: true [2022-10-16 13:16:02,334 INFO L899 garLoopResultBuilder]: For program point might_faultEXIT(lines 6661 6663) no Hoare annotation was computed. [2022-10-16 13:16:02,334 INFO L899 garLoopResultBuilder]: For program point lockdep_rcu_suspiciousFINAL(lines 6658 6660) no Hoare annotation was computed. [2022-10-16 13:16:02,335 INFO L902 garLoopResultBuilder]: At program point lockdep_rcu_suspiciousENTRY(lines 6658 6660) the Hoare annotation is: true [2022-10-16 13:16:02,335 INFO L899 garLoopResultBuilder]: For program point lockdep_rcu_suspiciousEXIT(lines 6658 6660) no Hoare annotation was computed. [2022-10-16 13:16:02,335 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5550 5556) no Hoare annotation was computed. [2022-10-16 13:16:02,335 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5550 5556) the Hoare annotation is: true [2022-10-16 13:16:02,335 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5550 5556) no Hoare annotation was computed. [2022-10-16 13:16:02,335 INFO L899 garLoopResultBuilder]: For program point reg_timer_1EXIT(lines 6121 6128) no Hoare annotation was computed. [2022-10-16 13:16:02,335 INFO L895 garLoopResultBuilder]: At program point reg_timer_1ENTRY(lines 6121 6128) the Hoare annotation is: (or (and (= ~ldv_timer_list_1~0.base |old(~ldv_timer_list_1~0.base)|) (= ~ldv_timer_state_1~0 |old(~ldv_timer_state_1~0)|) (= ~ldv_timer_list_1~0.offset |old(~ldv_timer_list_1~0.offset)|)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= 0 (+ ~last_index~0 2147483648))) (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) (not (<= ~last_index~0 15))) [2022-10-16 13:16:02,335 INFO L899 garLoopResultBuilder]: For program point reg_timer_1FINAL(lines 6121 6128) no Hoare annotation was computed. [2022-10-16 13:16:02,336 INFO L899 garLoopResultBuilder]: For program point _copy_to_userEXIT(lines 6606 6608) no Hoare annotation was computed. [2022-10-16 13:16:02,336 INFO L902 garLoopResultBuilder]: At program point _copy_to_userENTRY(lines 6606 6608) the Hoare annotation is: true [2022-10-16 13:16:02,336 INFO L899 garLoopResultBuilder]: For program point _copy_to_userFINAL(lines 6606 6608) no Hoare annotation was computed. [2022-10-16 13:16:02,336 INFO L899 garLoopResultBuilder]: For program point cisco_keepalive_sendErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5483) no Hoare annotation was computed. [2022-10-16 13:16:02,336 INFO L899 garLoopResultBuilder]: For program point cisco_keepalive_sendEXIT(lines 5692 5723) no Hoare annotation was computed. [2022-10-16 13:16:02,336 INFO L895 garLoopResultBuilder]: At program point L6359(lines 6354 6361) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,337 INFO L895 garLoopResultBuilder]: At program point L5707(line 5707) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,337 INFO L899 garLoopResultBuilder]: For program point L5707-1(line 5707) no Hoare annotation was computed. [2022-10-16 13:16:02,337 INFO L895 garLoopResultBuilder]: At program point L5709(line 5709) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,337 INFO L899 garLoopResultBuilder]: For program point L5709-1(line 5709) no Hoare annotation was computed. [2022-10-16 13:16:02,337 INFO L895 garLoopResultBuilder]: At program point L5484(lines 5480 5486) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,337 INFO L899 garLoopResultBuilder]: For program point L5701(lines 5701 5705) no Hoare annotation was computed. [2022-10-16 13:16:02,337 INFO L895 garLoopResultBuilder]: At program point L6692(lines 6689 6693) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,337 INFO L899 garLoopResultBuilder]: For program point cisco_keepalive_sendErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5483) no Hoare annotation was computed. [2022-10-16 13:16:02,338 INFO L895 garLoopResultBuilder]: At program point cisco_keepalive_sendENTRY(lines 5692 5723) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 (not (= ~ref_cnt~0 0)) .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,338 INFO L899 garLoopResultBuilder]: For program point cisco_keepalive_sendFINAL(lines 5692 5723) no Hoare annotation was computed. [2022-10-16 13:16:02,338 INFO L895 garLoopResultBuilder]: At program point L6358(line 6358) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 (not (= ~ref_cnt~0 0)) .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,338 INFO L895 garLoopResultBuilder]: At program point L5714(line 5714) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,338 INFO L895 garLoopResultBuilder]: At program point L6643(lines 6642 6644) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,339 INFO L899 garLoopResultBuilder]: For program point L6358-1(line 6358) no Hoare annotation was computed. [2022-10-16 13:16:02,339 INFO L899 garLoopResultBuilder]: For program point L5714-1(line 5714) no Hoare annotation was computed. [2022-10-16 13:16:02,339 INFO L899 garLoopResultBuilder]: For program point L5483(line 5483) no Hoare annotation was computed. [2022-10-16 13:16:02,339 INFO L899 garLoopResultBuilder]: For program point L5483-1(line 5483) no Hoare annotation was computed. [2022-10-16 13:16:02,339 INFO L895 garLoopResultBuilder]: At program point L5477(lines 5472 5479) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (= ~ref_cnt~0 0)) .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_state_variable_3~0 0))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,339 INFO L899 garLoopResultBuilder]: For program point __fswab16Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5123) no Hoare annotation was computed. [2022-10-16 13:16:02,339 INFO L902 garLoopResultBuilder]: At program point __fswab16ENTRY(lines 5120 5125) the Hoare annotation is: true [2022-10-16 13:16:02,339 INFO L899 garLoopResultBuilder]: For program point __fswab16Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5123) no Hoare annotation was computed. [2022-10-16 13:16:02,340 INFO L899 garLoopResultBuilder]: For program point __fswab16FINAL(lines 5120 5125) no Hoare annotation was computed. [2022-10-16 13:16:02,340 INFO L899 garLoopResultBuilder]: For program point L5123(line 5123) no Hoare annotation was computed. [2022-10-16 13:16:02,340 INFO L899 garLoopResultBuilder]: For program point L5123-1(line 5123) no Hoare annotation was computed. [2022-10-16 13:16:02,340 INFO L899 garLoopResultBuilder]: For program point __fswab16EXIT(lines 5120 5125) no Hoare annotation was computed. [2022-10-16 13:16:02,340 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5557 5563) no Hoare annotation was computed. [2022-10-16 13:16:02,340 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5557 5563) the Hoare annotation is: true [2022-10-16 13:16:02,340 INFO L899 garLoopResultBuilder]: For program point _raw_spin_lock_irqsaveFINAL(lines 6613 6615) no Hoare annotation was computed. [2022-10-16 13:16:02,341 INFO L899 garLoopResultBuilder]: For program point _raw_spin_lock_irqsaveEXIT(lines 6613 6615) no Hoare annotation was computed. [2022-10-16 13:16:02,341 INFO L902 garLoopResultBuilder]: At program point _raw_spin_lock_irqsaveENTRY(lines 6613 6615) the Hoare annotation is: true [2022-10-16 13:16:02,341 INFO L902 garLoopResultBuilder]: At program point spin_lockENTRY(lines 5260 5266) the Hoare annotation is: true [2022-10-16 13:16:02,341 INFO L899 garLoopResultBuilder]: For program point spin_lockFINAL(lines 5260 5266) no Hoare annotation was computed. [2022-10-16 13:16:02,341 INFO L902 garLoopResultBuilder]: At program point L6610(lines 6609 6611) the Hoare annotation is: true [2022-10-16 13:16:02,341 INFO L899 garLoopResultBuilder]: For program point spin_lockEXIT(lines 5260 5266) no Hoare annotation was computed. [2022-10-16 13:16:02,341 INFO L899 garLoopResultBuilder]: For program point stateEXIT(lines 5667 5672) no Hoare annotation was computed. [2022-10-16 13:16:02,342 INFO L902 garLoopResultBuilder]: At program point stateENTRY(lines 5667 5672) the Hoare annotation is: true [2022-10-16 13:16:02,342 INFO L899 garLoopResultBuilder]: For program point stateFINAL(lines 5667 5672) no Hoare annotation was computed. [2022-10-16 13:16:02,342 INFO L899 garLoopResultBuilder]: For program point dev_to_hdlcEXIT(lines 5636 5643) no Hoare annotation was computed. [2022-10-16 13:16:02,342 INFO L902 garLoopResultBuilder]: At program point L5595(lines 5592 5597) the Hoare annotation is: true [2022-10-16 13:16:02,342 INFO L902 garLoopResultBuilder]: At program point dev_to_hdlcENTRY(lines 5636 5643) the Hoare annotation is: true [2022-10-16 13:16:02,342 INFO L899 garLoopResultBuilder]: For program point dev_to_hdlcFINAL(lines 5636 5643) no Hoare annotation was computed. [2022-10-16 13:16:02,342 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5564 5569) no Hoare annotation was computed. [2022-10-16 13:16:02,342 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5564 5569) the Hoare annotation is: true [2022-10-16 13:16:02,343 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5564 5569) no Hoare annotation was computed. [2022-10-16 13:16:02,343 INFO L902 garLoopResultBuilder]: At program point L5436(lines 5415 5438) the Hoare annotation is: true [2022-10-16 13:16:02,343 INFO L902 garLoopResultBuilder]: At program point L6006(line 6006) the Hoare annotation is: true [2022-10-16 13:16:02,343 INFO L899 garLoopResultBuilder]: For program point L6006-1(line 6006) no Hoare annotation was computed. [2022-10-16 13:16:02,343 INFO L902 garLoopResultBuilder]: At program point L5453(line 5453) the Hoare annotation is: true [2022-10-16 13:16:02,343 INFO L899 garLoopResultBuilder]: For program point L5453-1(line 5453) no Hoare annotation was computed. [2022-10-16 13:16:02,343 INFO L899 garLoopResultBuilder]: For program point L6015(lines 6015 6019) no Hoare annotation was computed. [2022-10-16 13:16:02,343 INFO L899 garLoopResultBuilder]: For program point L6048-1(line 6048) no Hoare annotation was computed. [2022-10-16 13:16:02,344 INFO L902 garLoopResultBuilder]: At program point L6593(lines 6592 6594) the Hoare annotation is: true [2022-10-16 13:16:02,344 INFO L902 garLoopResultBuilder]: At program point L6048(line 6048) the Hoare annotation is: true [2022-10-16 13:16:02,344 INFO L899 garLoopResultBuilder]: For program point L6015-2(lines 5993 6060) no Hoare annotation was computed. [2022-10-16 13:16:02,344 INFO L902 garLoopResultBuilder]: At program point L5429(line 5429) the Hoare annotation is: true [2022-10-16 13:16:02,344 INFO L899 garLoopResultBuilder]: For program point L5429-1(line 5429) no Hoare annotation was computed. [2022-10-16 13:16:02,344 INFO L899 garLoopResultBuilder]: For program point L5454(lines 5454 5458) no Hoare annotation was computed. [2022-10-16 13:16:02,344 INFO L899 garLoopResultBuilder]: For program point L5454-2(lines 5450 5459) no Hoare annotation was computed. [2022-10-16 13:16:02,344 INFO L902 garLoopResultBuilder]: At program point L5991(line 5991) the Hoare annotation is: true [2022-10-16 13:16:02,345 INFO L899 garLoopResultBuilder]: For program point L5991-1(line 5991) no Hoare annotation was computed. [2022-10-16 13:16:02,345 INFO L899 garLoopResultBuilder]: For program point L6024(lines 6024 6027) no Hoare annotation was computed. [2022-10-16 13:16:02,345 INFO L902 garLoopResultBuilder]: At program point L6627(lines 6626 6628) the Hoare annotation is: true [2022-10-16 13:16:02,345 INFO L899 garLoopResultBuilder]: For program point L5430(lines 5430 5434) no Hoare annotation was computed. [2022-10-16 13:16:02,345 INFO L899 garLoopResultBuilder]: For program point L6008(lines 6008 6011) no Hoare annotation was computed. [2022-10-16 13:16:02,345 INFO L899 garLoopResultBuilder]: For program point L5430-2(lines 5426 5435) no Hoare annotation was computed. [2022-10-16 13:16:02,345 INFO L902 garLoopResultBuilder]: At program point L5455(line 5455) the Hoare annotation is: true [2022-10-16 13:16:02,346 INFO L899 garLoopResultBuilder]: For program point L6033-2(lines 6033 6036) no Hoare annotation was computed. [2022-10-16 13:16:02,346 INFO L899 garLoopResultBuilder]: For program point L5455-1(line 5455) no Hoare annotation was computed. [2022-10-16 13:16:02,346 INFO L899 garLoopResultBuilder]: For program point L6033(line 6033) no Hoare annotation was computed. [2022-10-16 13:16:02,346 INFO L902 garLoopResultBuilder]: At program point L6058(line 6058) the Hoare annotation is: true [2022-10-16 13:16:02,346 INFO L899 garLoopResultBuilder]: For program point L6058-1(line 6058) no Hoare annotation was computed. [2022-10-16 13:16:02,346 INFO L902 garLoopResultBuilder]: At program point L5431(line 5431) the Hoare annotation is: true [2022-10-16 13:16:02,346 INFO L899 garLoopResultBuilder]: For program point L5431-1(line 5431) no Hoare annotation was computed. [2022-10-16 13:16:02,346 INFO L899 garLoopResultBuilder]: For program point L6001(lines 6001 6005) no Hoare annotation was computed. [2022-10-16 13:16:02,347 INFO L902 garLoopResultBuilder]: At program point L5448-1(line 5448) the Hoare annotation is: true [2022-10-16 13:16:02,347 INFO L899 garLoopResultBuilder]: For program point L5993(lines 5993 6060) no Hoare annotation was computed. [2022-10-16 13:16:02,347 INFO L902 garLoopResultBuilder]: At program point L5448(line 5448) the Hoare annotation is: true [2022-10-16 13:16:02,347 INFO L902 garLoopResultBuilder]: At program point L6051(line 6051) the Hoare annotation is: true [2022-10-16 13:16:02,347 INFO L899 garLoopResultBuilder]: For program point L6051-1(line 6051) no Hoare annotation was computed. [2022-10-16 13:16:02,347 INFO L899 garLoopResultBuilder]: For program point L6043(lines 6043 6046) no Hoare annotation was computed. [2022-10-16 13:16:02,347 INFO L902 garLoopResultBuilder]: At program point L5424-1(line 5424) the Hoare annotation is: true [2022-10-16 13:16:02,348 INFO L902 garLoopResultBuilder]: At program point L5424(line 5424) the Hoare annotation is: true [2022-10-16 13:16:02,348 INFO L899 garLoopResultBuilder]: For program point L5994(line 5994) no Hoare annotation was computed. [2022-10-16 13:16:02,348 INFO L899 garLoopResultBuilder]: For program point L5449(line 5449) no Hoare annotation was computed. [2022-10-16 13:16:02,348 INFO L899 garLoopResultBuilder]: For program point L6052-1(line 6052) no Hoare annotation was computed. [2022-10-16 13:16:02,348 INFO L902 garLoopResultBuilder]: At program point L6052(line 6052) the Hoare annotation is: true [2022-10-16 13:16:02,348 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,348 INFO L902 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: true [2022-10-16 13:16:02,348 INFO L902 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: true [2022-10-16 13:16:02,348 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,349 INFO L899 garLoopResultBuilder]: For program point L5425(line 5425) no Hoare annotation was computed. [2022-10-16 13:16:02,349 INFO L902 garLoopResultBuilder]: At program point L5995(line 5995) the Hoare annotation is: true [2022-10-16 13:16:02,349 INFO L899 garLoopResultBuilder]: For program point L5995-1(line 5995) no Hoare annotation was computed. [2022-10-16 13:16:02,349 INFO L899 garLoopResultBuilder]: For program point L5450(lines 5450 5459) no Hoare annotation was computed. [2022-10-16 13:16:02,349 INFO L902 garLoopResultBuilder]: At program point L6631(lines 6630 6632) the Hoare annotation is: true [2022-10-16 13:16:02,349 INFO L902 garLoopResultBuilder]: At program point L6053(line 6053) the Hoare annotation is: true [2022-10-16 13:16:02,349 INFO L899 garLoopResultBuilder]: For program point L6053-1(line 6053) no Hoare annotation was computed. [2022-10-16 13:16:02,349 INFO L902 garLoopResultBuilder]: At program point L6590(lines 6589 6591) the Hoare annotation is: true [2022-10-16 13:16:02,350 INFO L899 garLoopResultBuilder]: For program point L5426(lines 5426 5435) no Hoare annotation was computed. [2022-10-16 13:16:02,350 INFO L899 garLoopResultBuilder]: For program point cisco_ioctlEXIT(lines 5968 6063) no Hoare annotation was computed. [2022-10-16 13:16:02,350 INFO L902 garLoopResultBuilder]: At program point L5451(line 5451) the Hoare annotation is: true [2022-10-16 13:16:02,350 INFO L899 garLoopResultBuilder]: For program point L5451-1(line 5451) no Hoare annotation was computed. [2022-10-16 13:16:02,350 INFO L899 garLoopResultBuilder]: For program point L6029(lines 6029 6032) no Hoare annotation was computed. [2022-10-16 13:16:02,350 INFO L899 garLoopResultBuilder]: For program point L5996(lines 5996 5999) no Hoare annotation was computed. [2022-10-16 13:16:02,350 INFO L902 garLoopResultBuilder]: At program point L6599(lines 6598 6600) the Hoare annotation is: true [2022-10-16 13:16:02,350 INFO L899 garLoopResultBuilder]: For program point L6013(line 6013) no Hoare annotation was computed. [2022-10-16 13:16:02,351 INFO L899 garLoopResultBuilder]: For program point L6038(lines 6038 6041) no Hoare annotation was computed. [2022-10-16 13:16:02,351 INFO L902 garLoopResultBuilder]: At program point L5427(line 5427) the Hoare annotation is: true [2022-10-16 13:16:02,351 INFO L899 garLoopResultBuilder]: For program point L5427-1(line 5427) no Hoare annotation was computed. [2022-10-16 13:16:02,351 INFO L902 garLoopResultBuilder]: At program point L5460(lines 5439 5462) the Hoare annotation is: true [2022-10-16 13:16:02,351 INFO L895 garLoopResultBuilder]: At program point cisco_ioctlENTRY(lines 5968 6063) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 3))) (.cse1 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) (.cse3 (not (<= ~last_index~0 15)))) (and (or (not (<= 0 ~ref_cnt~0)) .cse0 .cse1 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse2 .cse3) (or (not (<= 1 ~ref_cnt~0)) (not (<= 2 ~ldv_state_variable_3~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1)) .cse2 .cse3))) [2022-10-16 13:16:02,351 INFO L899 garLoopResultBuilder]: For program point cisco_ioctlFINAL(lines 5968 6063) no Hoare annotation was computed. [2022-10-16 13:16:02,351 INFO L899 garLoopResultBuilder]: For program point add_timerEXIT(lines 6622 6624) no Hoare annotation was computed. [2022-10-16 13:16:02,352 INFO L902 garLoopResultBuilder]: At program point add_timerENTRY(lines 6622 6624) the Hoare annotation is: true [2022-10-16 13:16:02,352 INFO L899 garLoopResultBuilder]: For program point add_timerFINAL(lines 6622 6624) no Hoare annotation was computed. [2022-10-16 13:16:02,352 INFO L902 garLoopResultBuilder]: At program point spin_unlockENTRY(lines 5267 5273) the Hoare annotation is: true [2022-10-16 13:16:02,352 INFO L899 garLoopResultBuilder]: For program point spin_unlockFINAL(lines 5267 5273) no Hoare annotation was computed. [2022-10-16 13:16:02,352 INFO L899 garLoopResultBuilder]: For program point spin_unlockEXIT(lines 5267 5273) no Hoare annotation was computed. [2022-10-16 13:16:02,352 INFO L902 garLoopResultBuilder]: At program point L6617(lines 6616 6618) the Hoare annotation is: true [2022-10-16 13:16:02,352 INFO L895 garLoopResultBuilder]: At program point L5354(lines 5319 5356) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,353 INFO L899 garLoopResultBuilder]: For program point L5784-2(lines 5784 5787) no Hoare annotation was computed. [2022-10-16 13:16:02,353 INFO L899 garLoopResultBuilder]: For program point L5784(line 5784) no Hoare annotation was computed. [2022-10-16 13:16:02,353 INFO L895 garLoopResultBuilder]: At program point L5867(line 5867) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,353 INFO L895 garLoopResultBuilder]: At program point L5834(lines 5773 5873) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,353 INFO L899 garLoopResultBuilder]: For program point L5867-1(line 5867) no Hoare annotation was computed. [2022-10-16 13:16:02,354 INFO L895 garLoopResultBuilder]: At program point L5801(line 5801) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,354 INFO L899 garLoopResultBuilder]: For program point L5801-1(line 5801) no Hoare annotation was computed. [2022-10-16 13:16:02,354 INFO L899 garLoopResultBuilder]: For program point cisco_rxFINAL(lines 5748 5874) no Hoare annotation was computed. [2022-10-16 13:16:02,354 INFO L899 garLoopResultBuilder]: For program point L5207(line 5207) no Hoare annotation was computed. [2022-10-16 13:16:02,354 INFO L899 garLoopResultBuilder]: For program point L5174(line 5174) no Hoare annotation was computed. [2022-10-16 13:16:02,354 INFO L895 garLoopResultBuilder]: At program point L5240(lines 5191 5243) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,355 INFO L895 garLoopResultBuilder]: At program point L5653(line 5653) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,355 INFO L899 garLoopResultBuilder]: For program point L5653-1(line 5653) no Hoare annotation was computed. [2022-10-16 13:16:02,355 INFO L899 garLoopResultBuilder]: For program point L5835(line 5835) no Hoare annotation was computed. [2022-10-16 13:16:02,355 INFO L895 garLoopResultBuilder]: At program point L5290(lines 5285 5292) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,355 INFO L899 garLoopResultBuilder]: For program point L5802(lines 5802 5863) no Hoare annotation was computed. [2022-10-16 13:16:02,355 INFO L899 garLoopResultBuilder]: For program point L5158(lines 5158 5162) no Hoare annotation was computed. [2022-10-16 13:16:02,356 INFO L895 garLoopResultBuilder]: At program point L5307(lines 5303 5309) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,356 INFO L899 garLoopResultBuilder]: For program point L5175(lines 5175 5182) no Hoare annotation was computed. [2022-10-16 13:16:02,356 INFO L895 garLoopResultBuilder]: At program point L6678(lines 6677 6679) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,356 INFO L899 garLoopResultBuilder]: For program point L5654(lines 5654 5662) no Hoare annotation was computed. [2022-10-16 13:16:02,356 INFO L899 garLoopResultBuilder]: For program point L5208(lines 5208 5215) no Hoare annotation was computed. [2022-10-16 13:16:02,356 INFO L899 garLoopResultBuilder]: For program point L5654-1(lines 5654 5662) no Hoare annotation was computed. [2022-10-16 13:16:02,357 INFO L899 garLoopResultBuilder]: For program point L5803(line 5803) no Hoare annotation was computed. [2022-10-16 13:16:02,357 INFO L899 garLoopResultBuilder]: For program point L5836-1(line 5836) no Hoare annotation was computed. [2022-10-16 13:16:02,357 INFO L895 garLoopResultBuilder]: At program point L5836(line 5836) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,357 INFO L895 garLoopResultBuilder]: At program point L5820(lines 5808 5827) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,357 INFO L899 garLoopResultBuilder]: For program point L5143(lines 5143 5186) no Hoare annotation was computed. [2022-10-16 13:16:02,358 INFO L895 garLoopResultBuilder]: At program point L5110(lines 5104 5112) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,358 INFO L899 garLoopResultBuilder]: For program point cisco_rxEXIT(lines 5748 5874) no Hoare annotation was computed. [2022-10-16 13:16:02,358 INFO L895 garLoopResultBuilder]: At program point L5391(line 5391) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,358 INFO L899 garLoopResultBuilder]: For program point L5391-1(line 5391) no Hoare annotation was computed. [2022-10-16 13:16:02,358 INFO L895 garLoopResultBuilder]: At program point L5837(line 5837) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,358 INFO L899 garLoopResultBuilder]: For program point L5837-1(line 5837) no Hoare annotation was computed. [2022-10-16 13:16:02,359 INFO L895 garLoopResultBuilder]: At program point L5408(lines 5384 5410) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,359 INFO L899 garLoopResultBuilder]: For program point L5788-1(line 5788) no Hoare annotation was computed. [2022-10-16 13:16:02,359 INFO L899 garLoopResultBuilder]: For program point L5821(lines 5821 5824) no Hoare annotation was computed. [2022-10-16 13:16:02,359 INFO L895 garLoopResultBuilder]: At program point L5788(line 5788) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,359 INFO L899 garLoopResultBuilder]: For program point L5144(line 5144) no Hoare annotation was computed. [2022-10-16 13:16:02,359 INFO L899 garLoopResultBuilder]: For program point L5656(lines 5656 5660) no Hoare annotation was computed. [2022-10-16 13:16:02,360 INFO L899 garLoopResultBuilder]: For program point L5392-1(lines 5392 5405) no Hoare annotation was computed. [2022-10-16 13:16:02,360 INFO L895 garLoopResultBuilder]: At program point L5871(line 5871) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,360 INFO L899 garLoopResultBuilder]: For program point L5871-1(line 5871) no Hoare annotation was computed. [2022-10-16 13:16:02,360 INFO L899 garLoopResultBuilder]: For program point L5392(lines 5392 5405) no Hoare annotation was computed. [2022-10-16 13:16:02,360 INFO L899 garLoopResultBuilder]: For program point L5227(line 5227) no Hoare annotation was computed. [2022-10-16 13:16:02,360 INFO L895 garLoopResultBuilder]: At program point L5822(lines 5808 5827) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,361 INFO L895 garLoopResultBuilder]: At program point L5376(line 5376) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,361 INFO L899 garLoopResultBuilder]: For program point L5211(lines 5211 5215) no Hoare annotation was computed. [2022-10-16 13:16:02,361 INFO L899 garLoopResultBuilder]: For program point L5178(lines 5178 5182) no Hoare annotation was computed. [2022-10-16 13:16:02,361 INFO L899 garLoopResultBuilder]: For program point L5789(lines 5789 5864) no Hoare annotation was computed. [2022-10-16 13:16:02,361 INFO L899 garLoopResultBuilder]: For program point L5145(lines 5145 5152) no Hoare annotation was computed. [2022-10-16 13:16:02,361 INFO L895 garLoopResultBuilder]: At program point L5839(line 5839) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,362 INFO L899 garLoopResultBuilder]: For program point L5839-1(line 5839) no Hoare annotation was computed. [2022-10-16 13:16:02,362 INFO L895 garLoopResultBuilder]: At program point L5393(line 5393) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,362 INFO L899 garLoopResultBuilder]: For program point L5393-1(line 5393) no Hoare annotation was computed. [2022-10-16 13:16:02,362 INFO L899 garLoopResultBuilder]: For program point L5228(lines 5228 5235) no Hoare annotation was computed. [2022-10-16 13:16:02,362 INFO L899 garLoopResultBuilder]: For program point L5790(line 5790) no Hoare annotation was computed. [2022-10-16 13:16:02,362 INFO L899 garLoopResultBuilder]: For program point L5344-2(lines 5327 5355) no Hoare annotation was computed. [2022-10-16 13:16:02,362 INFO L899 garLoopResultBuilder]: For program point L5344(lines 5344 5348) no Hoare annotation was computed. [2022-10-16 13:16:02,363 INFO L895 garLoopResultBuilder]: At program point L5658(line 5658) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,363 INFO L899 garLoopResultBuilder]: For program point L5625(lines 5625 5628) no Hoare annotation was computed. [2022-10-16 13:16:02,363 INFO L895 garLoopResultBuilder]: At program point L6649(lines 6648 6650) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,363 INFO L895 garLoopResultBuilder]: At program point L5625-1(lines 5620 5631) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,363 INFO L899 garLoopResultBuilder]: For program point L5394(lines 5394 5398) no Hoare annotation was computed. [2022-10-16 13:16:02,364 INFO L899 garLoopResultBuilder]: For program point L5328-1(line 5328) no Hoare annotation was computed. [2022-10-16 13:16:02,364 INFO L895 garLoopResultBuilder]: At program point L5328(line 5328) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,364 INFO L899 garLoopResultBuilder]: For program point L5394-2(lines 5392 5404) no Hoare annotation was computed. [2022-10-16 13:16:02,364 INFO L899 garLoopResultBuilder]: For program point L5196(lines 5196 5239) no Hoare annotation was computed. [2022-10-16 13:16:02,364 INFO L895 garLoopResultBuilder]: At program point L5791(line 5791) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,364 INFO L899 garLoopResultBuilder]: For program point L5791-1(line 5791) no Hoare annotation was computed. [2022-10-16 13:16:02,365 INFO L895 garLoopResultBuilder]: At program point L5626(line 5626) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,365 INFO L895 garLoopResultBuilder]: At program point L5775(line 5775) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,365 INFO L899 garLoopResultBuilder]: For program point L5808-1(lines 5808 5828) no Hoare annotation was computed. [2022-10-16 13:16:02,365 INFO L899 garLoopResultBuilder]: For program point L5775-1(line 5775) no Hoare annotation was computed. [2022-10-16 13:16:02,365 INFO L899 garLoopResultBuilder]: For program point L5841-3(line 5841) no Hoare annotation was computed. [2022-10-16 13:16:02,365 INFO L899 garLoopResultBuilder]: For program point L5329(lines 5329 5332) no Hoare annotation was computed. [2022-10-16 13:16:02,366 INFO L899 garLoopResultBuilder]: For program point L5841(line 5841) no Hoare annotation was computed. [2022-10-16 13:16:02,366 INFO L899 garLoopResultBuilder]: For program point L5808(lines 5808 5828) no Hoare annotation was computed. [2022-10-16 13:16:02,366 INFO L899 garLoopResultBuilder]: For program point L5841-1(line 5841) no Hoare annotation was computed. [2022-10-16 13:16:02,366 INFO L895 garLoopResultBuilder]: At program point L5841-6(lines 5841 5859) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,366 INFO L899 garLoopResultBuilder]: For program point L5197(line 5197) no Hoare annotation was computed. [2022-10-16 13:16:02,366 INFO L899 garLoopResultBuilder]: For program point L5164(line 5164) no Hoare annotation was computed. [2022-10-16 13:16:02,366 INFO L899 garLoopResultBuilder]: For program point L5841-5(lines 5841 5859) no Hoare annotation was computed. [2022-10-16 13:16:02,367 INFO L895 garLoopResultBuilder]: At program point L5825(lines 5808 5827) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,367 INFO L899 garLoopResultBuilder]: For program point L5148(lines 5148 5152) no Hoare annotation was computed. [2022-10-16 13:16:02,367 INFO L895 garLoopResultBuilder]: At program point cisco_rxENTRY(lines 5748 5874) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,367 INFO L899 garLoopResultBuilder]: For program point L5231(lines 5231 5235) no Hoare annotation was computed. [2022-10-16 13:16:02,367 INFO L899 garLoopResultBuilder]: For program point L5198(lines 5198 5205) no Hoare annotation was computed. [2022-10-16 13:16:02,367 INFO L899 garLoopResultBuilder]: For program point L5165(lines 5165 5172) no Hoare annotation was computed. [2022-10-16 13:16:02,368 INFO L895 garLoopResultBuilder]: At program point L5314(lines 5310 5316) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,368 INFO L899 garLoopResultBuilder]: For program point L5793(line 5793) no Hoare annotation was computed. [2022-10-16 13:16:02,368 INFO L899 garLoopResultBuilder]: For program point L5843(lines 5843 5857) no Hoare annotation was computed. [2022-10-16 13:16:02,368 INFO L895 garLoopResultBuilder]: At program point L5298(lines 5293 5300) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,368 INFO L895 garLoopResultBuilder]: At program point L5777(line 5777) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,369 INFO L899 garLoopResultBuilder]: For program point L5777-1(line 5777) no Hoare annotation was computed. [2022-10-16 13:16:02,369 INFO L899 garLoopResultBuilder]: For program point L5794(line 5794) no Hoare annotation was computed. [2022-10-16 13:16:02,369 INFO L895 garLoopResultBuilder]: At program point L5860(line 5860) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,369 INFO L899 garLoopResultBuilder]: For program point L5794-2(lines 5794 5799) no Hoare annotation was computed. [2022-10-16 13:16:02,369 INFO L895 garLoopResultBuilder]: At program point L6653(lines 6652 6654) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,369 INFO L899 garLoopResultBuilder]: For program point L5844-1(line 5844) no Hoare annotation was computed. [2022-10-16 13:16:02,370 INFO L895 garLoopResultBuilder]: At program point L5844(line 5844) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (<= ~last_index~0 15) (= |old(#valid)| |#valid|) (<= 0 (+ ~last_index~0 2147483648)))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse5 (not (<= 1 ~ref_cnt~0))) (.cse6 (not (<= 2 ~ldv_state_variable_3~0))) (.cse7 (not (<= ~ref_cnt~0 1))) (.cse8 (not (= |old(~last_index~0)| 0))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse4 (not (= ~ldv_state_variable_3~0 1))) (.cse9 (= ~last_index~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 .cse4 (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (or .cse5 .cse8 .cse6 .cse3 .cse9 .cse7) (or (not (= ~ref_cnt~0 0)) .cse8 .cse3 .cse4 .cse9))) [2022-10-16 13:16:02,370 INFO L899 garLoopResultBuilder]: For program point L5861(line 5861) no Hoare annotation was computed. [2022-10-16 13:16:02,370 INFO L895 garLoopResultBuilder]: At program point L5663(lines 5645 5665) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,370 INFO L899 garLoopResultBuilder]: For program point L5217(line 5217) no Hoare annotation was computed. [2022-10-16 13:16:02,370 INFO L899 garLoopResultBuilder]: For program point L5184(line 5184) no Hoare annotation was computed. [2022-10-16 13:16:02,371 INFO L895 garLoopResultBuilder]: At program point L5366(line 5366) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,371 INFO L899 garLoopResultBuilder]: For program point L5366-1(line 5366) no Hoare annotation was computed. [2022-10-16 13:16:02,371 INFO L895 garLoopResultBuilder]: At program point L5333(line 5333) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,371 INFO L899 garLoopResultBuilder]: For program point L5333-1(line 5333) no Hoare annotation was computed. [2022-10-16 13:16:02,371 INFO L899 garLoopResultBuilder]: For program point L5201(lines 5201 5205) no Hoare annotation was computed. [2022-10-16 13:16:02,371 INFO L899 garLoopResultBuilder]: For program point L5168(lines 5168 5172) no Hoare annotation was computed. [2022-10-16 13:16:02,372 INFO L899 garLoopResultBuilder]: For program point L5218(lines 5218 5225) no Hoare annotation was computed. [2022-10-16 13:16:02,372 INFO L899 garLoopResultBuilder]: For program point L5367(lines 5367 5380) no Hoare annotation was computed. [2022-10-16 13:16:02,372 INFO L895 garLoopResultBuilder]: At program point L5367-1(lines 5357 5383) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,372 INFO L899 garLoopResultBuilder]: For program point L5334(lines 5334 5338) no Hoare annotation was computed. [2022-10-16 13:16:02,372 INFO L899 garLoopResultBuilder]: For program point L5813(lines 5813 5818) no Hoare annotation was computed. [2022-10-16 13:16:02,372 INFO L899 garLoopResultBuilder]: For program point L5780(lines 5780 5783) no Hoare annotation was computed. [2022-10-16 13:16:02,372 INFO L899 garLoopResultBuilder]: For program point L5334-2(lines 5327 5355) no Hoare annotation was computed. [2022-10-16 13:16:02,373 INFO L895 garLoopResultBuilder]: At program point L5830(line 5830) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,373 INFO L899 garLoopResultBuilder]: For program point L5830-1(line 5830) no Hoare annotation was computed. [2022-10-16 13:16:02,373 INFO L895 garLoopResultBuilder]: At program point L6656(lines 6655 6657) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,373 INFO L899 garLoopResultBuilder]: For program point L5368-1(line 5368) no Hoare annotation was computed. [2022-10-16 13:16:02,373 INFO L895 garLoopResultBuilder]: At program point L5401(line 5401) the Hoare annotation is: (let ((.cse0 (not (<= |old(~last_index~0)| 15))) (.cse1 (and (<= ~last_index~0 15) (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))) (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))))) [2022-10-16 13:16:02,374 INFO L895 garLoopResultBuilder]: At program point L5368(line 5368) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,374 INFO L895 garLoopResultBuilder]: At program point L5187(lines 5138 5190) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,374 INFO L899 garLoopResultBuilder]: For program point L5154(line 5154) no Hoare annotation was computed. [2022-10-16 13:16:02,374 INFO L899 garLoopResultBuilder]: For program point L5369-2(lines 5367 5379) no Hoare annotation was computed. [2022-10-16 13:16:02,374 INFO L899 garLoopResultBuilder]: For program point L5369(lines 5369 5373) no Hoare annotation was computed. [2022-10-16 13:16:02,374 INFO L899 garLoopResultBuilder]: For program point L5237(line 5237) no Hoare annotation was computed. [2022-10-16 13:16:02,374 INFO L895 garLoopResultBuilder]: At program point L5865(line 5865) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))) (.cse1 (not (<= |old(~last_index~0)| 15))) (.cse2 (not (<= 0 (+ |old(~last_index~0)| 2147483648)))) (.cse3 (not (= ~ldv_state_variable_0~0 3)))) (and (or .cse0 .cse1 .cse2 (not (<= 0 ~ref_cnt~0)) .cse3 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0))) (or .cse0 .cse1 (not (<= 1 ~ref_cnt~0)) .cse2 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point L5832(line 5832) no Hoare annotation was computed. [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point L5865-1(line 5865) no Hoare annotation was computed. [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point L5155(lines 5155 5162) no Hoare annotation was computed. [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point L5221(lines 5221 5225) no Hoare annotation was computed. [2022-10-16 13:16:02,375 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5497 5499) the Hoare annotation is: true [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point L5498(line 5498) no Hoare annotation was computed. [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point L5498-2(lines 5497 5499) no Hoare annotation was computed. [2022-10-16 13:16:02,375 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5497 5499) no Hoare annotation was computed. [2022-10-16 13:16:02,376 INFO L899 garLoopResultBuilder]: For program point debug_lockdep_rcu_enabledEXIT(lines 6634 6636) no Hoare annotation was computed. [2022-10-16 13:16:02,376 INFO L902 garLoopResultBuilder]: At program point debug_lockdep_rcu_enabledENTRY(lines 6634 6636) the Hoare annotation is: true [2022-10-16 13:16:02,376 INFO L899 garLoopResultBuilder]: For program point debug_lockdep_rcu_enabledFINAL(lines 6634 6636) no Hoare annotation was computed. [2022-10-16 13:16:02,376 INFO L899 garLoopResultBuilder]: For program point linkwatch_fire_eventFINAL(lines 6645 6647) no Hoare annotation was computed. [2022-10-16 13:16:02,376 INFO L899 garLoopResultBuilder]: For program point linkwatch_fire_eventEXIT(lines 6645 6647) no Hoare annotation was computed. [2022-10-16 13:16:02,376 INFO L902 garLoopResultBuilder]: At program point linkwatch_fire_eventENTRY(lines 6645 6647) the Hoare annotation is: true [2022-10-16 13:16:02,376 INFO L899 garLoopResultBuilder]: For program point L5729(lines 5729 5732) no Hoare annotation was computed. [2022-10-16 13:16:02,376 INFO L899 garLoopResultBuilder]: For program point cisco_type_transFINAL(lines 5724 5747) no Hoare annotation was computed. [2022-10-16 13:16:02,377 INFO L899 garLoopResultBuilder]: For program point L5738(line 5738) no Hoare annotation was computed. [2022-10-16 13:16:02,377 INFO L899 garLoopResultBuilder]: For program point L5740(line 5740) no Hoare annotation was computed. [2022-10-16 13:16:02,377 INFO L899 garLoopResultBuilder]: For program point L5738-2(line 5738) no Hoare annotation was computed. [2022-10-16 13:16:02,377 INFO L902 garLoopResultBuilder]: At program point L6684-2(lines 6683 6685) the Hoare annotation is: true [2022-10-16 13:16:02,377 INFO L899 garLoopResultBuilder]: For program point L6684-1(line 6684) no Hoare annotation was computed. [2022-10-16 13:16:02,377 INFO L895 garLoopResultBuilder]: At program point L6684(line 6684) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse2 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse3 (not (<= ~last_index~0 15)))) (and (or (not (<= 1 ~ref_cnt~0)) .cse0 (not (<= 2 ~ldv_state_variable_3~0)) .cse1 .cse2 (not (<= ~ref_cnt~0 1)) .cse3) (or (not (<= 0 ~ref_cnt~0)) .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse3))) [2022-10-16 13:16:02,377 INFO L899 garLoopResultBuilder]: For program point L5743(line 5743) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L899 garLoopResultBuilder]: For program point L5739(line 5739) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L895 garLoopResultBuilder]: At program point cisco_type_transENTRY(lines 5724 5747) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse2 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse3 (not (<= ~last_index~0 15)))) (and (or (not (<= 1 ~ref_cnt~0)) .cse0 (not (<= 2 ~ldv_state_variable_3~0)) .cse1 .cse2 (not (<= ~ref_cnt~0 1)) .cse3) (or (not (<= 0 ~ref_cnt~0)) .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse3))) [2022-10-16 13:16:02,378 INFO L899 garLoopResultBuilder]: For program point L5739-2(line 5739) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L899 garLoopResultBuilder]: For program point L5737(lines 5737 5745) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L899 garLoopResultBuilder]: For program point cisco_type_transEXIT(lines 5724 5747) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L899 garLoopResultBuilder]: For program point L5733-2(lines 5733 5736) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L899 garLoopResultBuilder]: For program point L5733(line 5733) no Hoare annotation was computed. [2022-10-16 13:16:02,378 INFO L902 garLoopResultBuilder]: At program point spin_unlock_irqrestoreENTRY(lines 5274 5280) the Hoare annotation is: true [2022-10-16 13:16:02,379 INFO L902 garLoopResultBuilder]: At program point L6620(lines 6619 6621) the Hoare annotation is: true [2022-10-16 13:16:02,379 INFO L899 garLoopResultBuilder]: For program point spin_unlock_irqrestoreEXIT(lines 5274 5280) no Hoare annotation was computed. [2022-10-16 13:16:02,379 INFO L899 garLoopResultBuilder]: For program point spin_unlock_irqrestoreFINAL(lines 5274 5280) no Hoare annotation was computed. [2022-10-16 13:16:02,379 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5500 5516) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse3 (not (<= ~last_index~0 15)))) (and (or (not (<= 1 ~ref_cnt~0)) .cse0 (not (<= 2 ~ldv_state_variable_3~0)) .cse1 .cse2 (not (<= ~ref_cnt~0 1)) .cse3) (or (not (<= 0 ~ref_cnt~0)) .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse3) (or (not (= ~ref_cnt~0 0)) .cse0 (not (= ~ldv_state_variable_2~0 0)) .cse2 (not (= ~ldv_state_variable_3~0 0)) .cse3))) [2022-10-16 13:16:02,379 INFO L899 garLoopResultBuilder]: For program point L5512-1(line 5512) no Hoare annotation was computed. [2022-10-16 13:16:02,379 INFO L902 garLoopResultBuilder]: At program point L5512(line 5512) the Hoare annotation is: true [2022-10-16 13:16:02,379 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5500 5516) no Hoare annotation was computed. [2022-10-16 13:16:02,379 INFO L899 garLoopResultBuilder]: For program point L5507(lines 5507 5514) no Hoare annotation was computed. [2022-10-16 13:16:02,380 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5500 5516) no Hoare annotation was computed. [2022-10-16 13:16:02,380 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,380 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5517 5533) no Hoare annotation was computed. [2022-10-16 13:16:02,380 INFO L902 garLoopResultBuilder]: At program point L5529(line 5529) the Hoare annotation is: true [2022-10-16 13:16:02,380 INFO L899 garLoopResultBuilder]: For program point L5529-1(line 5529) no Hoare annotation was computed. [2022-10-16 13:16:02,380 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 5517 5533) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (.cse3 (not (= ~ldv_state_variable_0~0 3))) (.cse1 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (not (<= ~last_index~0 15)))) (and (or (not (= ~ref_cnt~0 0)) .cse0 (not (= ~ldv_state_variable_2~0 0)) .cse1 (not (= ~ldv_state_variable_3~0 0)) .cse2) (or (not (<= 1 ~ref_cnt~0)) .cse0 (not (<= 2 ~ldv_state_variable_3~0)) .cse3 .cse1 (not (<= ~ref_cnt~0 1)) .cse2) (or .cse0 (not (<= 0 ~ref_cnt~0)) .cse3 .cse1 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse2))) [2022-10-16 13:16:02,380 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5517 5533) no Hoare annotation was computed. [2022-10-16 13:16:02,381 INFO L899 garLoopResultBuilder]: For program point L5524(lines 5524 5531) no Hoare annotation was computed. [2022-10-16 13:16:02,381 INFO L902 garLoopResultBuilder]: At program point L5614(line 5614) the Hoare annotation is: true [2022-10-16 13:16:02,381 INFO L902 garLoopResultBuilder]: At program point L5101(lines 5095 5103) the Hoare annotation is: true [2022-10-16 13:16:02,381 INFO L899 garLoopResultBuilder]: For program point L5613(lines 5613 5616) no Hoare annotation was computed. [2022-10-16 13:16:02,381 INFO L899 garLoopResultBuilder]: For program point L5613-1(lines 5608 5619) no Hoare annotation was computed. [2022-10-16 13:16:02,381 INFO L902 garLoopResultBuilder]: At program point netif_dormant_onENTRY(lines 5608 5619) the Hoare annotation is: true [2022-10-16 13:16:02,381 INFO L899 garLoopResultBuilder]: For program point netif_dormant_onEXIT(lines 5608 5619) no Hoare annotation was computed. [2022-10-16 13:16:02,381 INFO L899 garLoopResultBuilder]: For program point _copy_from_userEXIT(lines 6602 6604) no Hoare annotation was computed. [2022-10-16 13:16:02,381 INFO L902 garLoopResultBuilder]: At program point _copy_from_userENTRY(lines 6602 6604) the Hoare annotation is: true [2022-10-16 13:16:02,382 INFO L899 garLoopResultBuilder]: For program point _copy_from_userFINAL(lines 6602 6604) no Hoare annotation was computed. [2022-10-16 13:16:02,382 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6267) no Hoare annotation was computed. [2022-10-16 13:16:02,382 INFO L899 garLoopResultBuilder]: For program point L6295(lines 6295 6300) no Hoare annotation was computed. [2022-10-16 13:16:02,382 INFO L895 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,382 INFO L899 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2022-10-16 13:16:02,382 INFO L899 garLoopResultBuilder]: For program point L5932(line 5932) no Hoare annotation was computed. [2022-10-16 13:16:02,382 INFO L895 garLoopResultBuilder]: At program point L6246(line 6246) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,383 INFO L895 garLoopResultBuilder]: At program point L6312(lines 6160 6317) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,383 INFO L899 garLoopResultBuilder]: For program point L6246-1(line 6246) no Hoare annotation was computed. [2022-10-16 13:16:02,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,383 INFO L895 garLoopResultBuilder]: At program point L5949(line 5949) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,383 INFO L899 garLoopResultBuilder]: For program point L5949-1(line 5949) no Hoare annotation was computed. [2022-10-16 13:16:02,383 INFO L899 garLoopResultBuilder]: For program point L6263(line 6263) no Hoare annotation was computed. [2022-10-16 13:16:02,383 INFO L899 garLoopResultBuilder]: For program point L6296-1(lines 6296 6297) no Hoare annotation was computed. [2022-10-16 13:16:02,383 INFO L899 garLoopResultBuilder]: For program point L6230(lines 6230 6285) no Hoare annotation was computed. [2022-10-16 13:16:02,384 INFO L895 garLoopResultBuilder]: At program point L6296(lines 6296 6297) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,384 INFO L895 garLoopResultBuilder]: At program point L5900-1(line 5900) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,384 INFO L895 garLoopResultBuilder]: At program point L5900(line 5900) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,384 INFO L902 garLoopResultBuilder]: At program point L6214(lines 6160 6317) the Hoare annotation is: true [2022-10-16 13:16:02,384 INFO L899 garLoopResultBuilder]: For program point L6231(line 6231) no Hoare annotation was computed. [2022-10-16 13:16:02,384 INFO L899 garLoopResultBuilder]: For program point L6264(lines 6264 6269) no Hoare annotation was computed. [2022-10-16 13:16:02,384 INFO L899 garLoopResultBuilder]: For program point L6132(lines 6132 6136) no Hoare annotation was computed. [2022-10-16 13:16:02,385 INFO L899 garLoopResultBuilder]: For program point L5901(line 5901) no Hoare annotation was computed. [2022-10-16 13:16:02,385 INFO L895 garLoopResultBuilder]: At program point L5951(line 5951) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,385 INFO L899 garLoopResultBuilder]: For program point L5951-1(line 5951) no Hoare annotation was computed. [2022-10-16 13:16:02,385 INFO L895 garLoopResultBuilder]: At program point L6529(lines 6525 6531) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,385 INFO L899 garLoopResultBuilder]: For program point L6232(lines 6232 6237) no Hoare annotation was computed. [2022-10-16 13:16:02,385 INFO L899 garLoopResultBuilder]: For program point L6183(lines 6183 6311) no Hoare annotation was computed. [2022-10-16 13:16:02,385 INFO L902 garLoopResultBuilder]: At program point L6695(lines 6694 6696) the Hoare annotation is: true [2022-10-16 13:16:02,386 INFO L895 garLoopResultBuilder]: At program point L5886(line 5886) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,386 INFO L899 garLoopResultBuilder]: For program point L5886-1(line 5886) no Hoare annotation was computed. [2022-10-16 13:16:02,386 INFO L895 garLoopResultBuilder]: At program point L6167(line 6167) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,386 INFO L899 garLoopResultBuilder]: For program point L6167-1(line 6167) no Hoare annotation was computed. [2022-10-16 13:16:02,386 INFO L895 garLoopResultBuilder]: At program point L6068(lines 6064 6070) the Hoare annotation is: (and (<= ~last_index~0 15) (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,386 INFO L895 garLoopResultBuilder]: At program point L6382(lines 6377 6384) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,386 INFO L895 garLoopResultBuilder]: At program point L5936-1(lines 5909 5939) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,386 INFO L895 garLoopResultBuilder]: At program point L5936(line 5936) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,387 INFO L899 garLoopResultBuilder]: For program point L6283(line 6283) no Hoare annotation was computed. [2022-10-16 13:16:02,387 INFO L902 garLoopResultBuilder]: At program point L6316(lines 6140 6318) the Hoare annotation is: true [2022-10-16 13:16:02,387 INFO L895 garLoopResultBuilder]: At program point L6118(lines 6111 6120) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,387 INFO L899 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2022-10-16 13:16:02,387 INFO L899 garLoopResultBuilder]: For program point L5920-1(line 5920) no Hoare annotation was computed. [2022-10-16 13:16:02,387 INFO L895 garLoopResultBuilder]: At program point L5920(line 5920) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,387 INFO L899 garLoopResultBuilder]: For program point L6267(line 6267) no Hoare annotation was computed. [2022-10-16 13:16:02,388 INFO L899 garLoopResultBuilder]: For program point L6267-1(line 6267) no Hoare annotation was computed. [2022-10-16 13:16:02,388 INFO L899 garLoopResultBuilder]: For program point L6251(line 6251) no Hoare annotation was computed. [2022-10-16 13:16:02,388 INFO L902 garLoopResultBuilder]: At program point L6284(line 6284) the Hoare annotation is: true [2022-10-16 13:16:02,388 INFO L899 garLoopResultBuilder]: For program point L6185(lines 6185 6188) no Hoare annotation was computed. [2022-10-16 13:16:02,388 INFO L895 garLoopResultBuilder]: At program point L5954(line 5954) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,388 INFO L899 garLoopResultBuilder]: For program point L5888-1(line 5888) no Hoare annotation was computed. [2022-10-16 13:16:02,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,388 INFO L899 garLoopResultBuilder]: For program point L5954-1(line 5954) no Hoare annotation was computed. [2022-10-16 13:16:02,389 INFO L895 garLoopResultBuilder]: At program point L5888(line 5888) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,389 INFO L899 garLoopResultBuilder]: For program point L6235(line 6235) no Hoare annotation was computed. [2022-10-16 13:16:02,389 INFO L899 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2022-10-16 13:16:02,389 INFO L899 garLoopResultBuilder]: For program point L6235-1(line 6235) no Hoare annotation was computed. [2022-10-16 13:16:02,389 INFO L899 garLoopResultBuilder]: For program point L6582(lines 6582 6585) no Hoare annotation was computed. [2022-10-16 13:16:02,389 INFO L895 garLoopResultBuilder]: At program point L6169(line 6169) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,389 INFO L899 garLoopResultBuilder]: For program point L6169-1(line 6169) no Hoare annotation was computed. [2022-10-16 13:16:02,389 INFO L895 garLoopResultBuilder]: At program point L6681(lines 6680 6682) the Hoare annotation is: (and (<= ~last_index~0 15) (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,390 INFO L895 garLoopResultBuilder]: At program point L5905(line 5905) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,390 INFO L895 garLoopResultBuilder]: At program point L5905-1(lines 5875 5908) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,390 INFO L899 garLoopResultBuilder]: For program point L6252-2(lines 6230 6285) no Hoare annotation was computed. [2022-10-16 13:16:02,390 INFO L899 garLoopResultBuilder]: For program point L6252(lines 6252 6256) no Hoare annotation was computed. [2022-10-16 13:16:02,390 INFO L895 garLoopResultBuilder]: At program point L5955(line 5955) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,390 INFO L895 garLoopResultBuilder]: At program point L5922(line 5922) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,390 INFO L899 garLoopResultBuilder]: For program point L5955-1(line 5955) no Hoare annotation was computed. [2022-10-16 13:16:02,391 INFO L899 garLoopResultBuilder]: For program point L6302(line 6302) no Hoare annotation was computed. [2022-10-16 13:16:02,391 INFO L899 garLoopResultBuilder]: For program point L5922-1(line 5922) no Hoare annotation was computed. [2022-10-16 13:16:02,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6267) no Hoare annotation was computed. [2022-10-16 13:16:02,391 INFO L899 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2022-10-16 13:16:02,391 INFO L899 garLoopResultBuilder]: For program point L6104-1(line 6104) no Hoare annotation was computed. [2022-10-16 13:16:02,391 INFO L895 garLoopResultBuilder]: At program point L6137(lines 6129 6139) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,391 INFO L895 garLoopResultBuilder]: At program point L6104(line 6104) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,391 INFO L895 garLoopResultBuilder]: At program point L6253(line 6253) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,392 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-10-16 13:16:02,392 INFO L899 garLoopResultBuilder]: For program point L6253-1(line 6253) no Hoare annotation was computed. [2022-10-16 13:16:02,392 INFO L899 garLoopResultBuilder]: For program point L5956-1(line 5956) no Hoare annotation was computed. [2022-10-16 13:16:02,392 INFO L895 garLoopResultBuilder]: At program point L5890(line 5890) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,392 INFO L895 garLoopResultBuilder]: At program point L5956(line 5956) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,392 INFO L902 garLoopResultBuilder]: At program point L6303(line 6303) the Hoare annotation is: true [2022-10-16 13:16:02,392 INFO L899 garLoopResultBuilder]: For program point L5890-1(line 5890) no Hoare annotation was computed. [2022-10-16 13:16:02,393 INFO L895 garLoopResultBuilder]: At program point L6171(line 6171) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,393 INFO L899 garLoopResultBuilder]: For program point L6171-1(line 6171) no Hoare annotation was computed. [2022-10-16 13:16:02,393 INFO L902 garLoopResultBuilder]: At program point L6584-1(lines 6577 6588) the Hoare annotation is: true [2022-10-16 13:16:02,393 INFO L902 garLoopResultBuilder]: At program point L6584(line 6584) the Hoare annotation is: true [2022-10-16 13:16:02,393 INFO L902 garLoopResultBuilder]: At program point L6221(line 6221) the Hoare annotation is: true [2022-10-16 13:16:02,393 INFO L899 garLoopResultBuilder]: For program point L5891(line 5891) no Hoare annotation was computed. [2022-10-16 13:16:02,393 INFO L899 garLoopResultBuilder]: For program point L5924-1(line 5924) no Hoare annotation was computed. [2022-10-16 13:16:02,393 INFO L895 garLoopResultBuilder]: At program point L6370(lines 6362 6372) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,393 INFO L895 garLoopResultBuilder]: At program point L5924(line 5924) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point L6271(line 6271) no Hoare annotation was computed. [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point L5891-2(lines 5891 5896) no Hoare annotation was computed. [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6235) no Hoare annotation was computed. [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point L5891-3(lines 5891 5896) no Hoare annotation was computed. [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point L6205-2(lines 6203 6217) no Hoare annotation was computed. [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,394 INFO L895 garLoopResultBuilder]: At program point L6106(line 6106) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,394 INFO L899 garLoopResultBuilder]: For program point L6205(lines 6205 6211) no Hoare annotation was computed. [2022-10-16 13:16:02,395 INFO L899 garLoopResultBuilder]: For program point L6106-1(line 6106) no Hoare annotation was computed. [2022-10-16 13:16:02,395 INFO L902 garLoopResultBuilder]: At program point L6470(lines 6467 6472) the Hoare annotation is: true [2022-10-16 13:16:02,395 INFO L895 garLoopResultBuilder]: At program point L5925(line 5925) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,395 INFO L899 garLoopResultBuilder]: For program point L5925-1(line 5925) no Hoare annotation was computed. [2022-10-16 13:16:02,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6235) no Hoare annotation was computed. [2022-10-16 13:16:02,395 INFO L899 garLoopResultBuilder]: For program point L6239(line 6239) no Hoare annotation was computed. [2022-10-16 13:16:02,395 INFO L899 garLoopResultBuilder]: For program point L6272-2(lines 6230 6285) no Hoare annotation was computed. [2022-10-16 13:16:02,395 INFO L899 garLoopResultBuilder]: For program point L6272(lines 6272 6276) no Hoare annotation was computed. [2022-10-16 13:16:02,396 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,396 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-10-16 13:16:02,396 INFO L899 garLoopResultBuilder]: For program point L6190(line 6190) no Hoare annotation was computed. [2022-10-16 13:16:02,396 INFO L895 garLoopResultBuilder]: At program point L5959(line 5959) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,396 INFO L895 garLoopResultBuilder]: At program point L5959-1(lines 5940 5962) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,396 INFO L899 garLoopResultBuilder]: For program point L6240-2(lines 6230 6285) no Hoare annotation was computed. [2022-10-16 13:16:02,396 INFO L895 garLoopResultBuilder]: At program point L6273(line 6273) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,396 INFO L899 garLoopResultBuilder]: For program point L6240(lines 6240 6244) no Hoare annotation was computed. [2022-10-16 13:16:02,397 INFO L899 garLoopResultBuilder]: For program point L6273-1(line 6273) no Hoare annotation was computed. [2022-10-16 13:16:02,397 INFO L902 garLoopResultBuilder]: At program point L6075(lines 6071 6077) the Hoare annotation is: true [2022-10-16 13:16:02,397 INFO L895 garLoopResultBuilder]: At program point L6108(lines 6099 6110) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,397 INFO L899 garLoopResultBuilder]: For program point L6290(line 6290) no Hoare annotation was computed. [2022-10-16 13:16:02,397 INFO L899 garLoopResultBuilder]: For program point L6191(lines 6191 6225) no Hoare annotation was computed. [2022-10-16 13:16:02,397 INFO L895 garLoopResultBuilder]: At program point L5894(line 5894) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,397 INFO L895 garLoopResultBuilder]: At program point L6241(line 6241) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,398 INFO L899 garLoopResultBuilder]: For program point L6241-1(line 6241) no Hoare annotation was computed. [2022-10-16 13:16:02,398 INFO L899 garLoopResultBuilder]: For program point L6291(lines 6291 6307) no Hoare annotation was computed. [2022-10-16 13:16:02,398 INFO L895 garLoopResultBuilder]: At program point L6258(line 6258) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,398 INFO L899 garLoopResultBuilder]: For program point L6258-1(line 6258) no Hoare annotation was computed. [2022-10-16 13:16:02,398 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:16:02,398 INFO L895 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,398 INFO L895 garLoopResultBuilder]: At program point L6639(lines 6638 6640) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,398 INFO L899 garLoopResultBuilder]: For program point L6193(lines 6193 6222) no Hoare annotation was computed. [2022-10-16 13:16:02,399 INFO L899 garLoopResultBuilder]: For program point L6309(line 6309) no Hoare annotation was computed. [2022-10-16 13:16:02,399 INFO L899 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2022-10-16 13:16:02,399 INFO L899 garLoopResultBuilder]: For program point L6194(line 6194) no Hoare annotation was computed. [2022-10-16 13:16:02,399 INFO L899 garLoopResultBuilder]: For program point L6293(lines 6293 6304) no Hoare annotation was computed. [2022-10-16 13:16:02,399 INFO L895 garLoopResultBuilder]: At program point L6161(line 6161) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_3~0 0)) [2022-10-16 13:16:02,399 INFO L899 garLoopResultBuilder]: For program point L6161-1(line 6161) no Hoare annotation was computed. [2022-10-16 13:16:02,399 INFO L902 garLoopResultBuilder]: At program point L6310(line 6310) the Hoare annotation is: true [2022-10-16 13:16:02,399 INFO L895 garLoopResultBuilder]: At program point L5897(line 5897) the Hoare annotation is: (let ((.cse0 (<= ~last_index~0 15)) (.cse1 (<= 0 (+ ~last_index~0 2147483648))) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) .cse0 (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_2~0 0) (= ~ref_cnt~0 0) .cse1 (= ~ldv_state_variable_3~0 0)) (and .cse0 (<= 1 ~ref_cnt~0) .cse1 .cse2 (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)))) [2022-10-16 13:16:02,400 INFO L899 garLoopResultBuilder]: For program point L5897-1(line 5897) no Hoare annotation was computed. [2022-10-16 13:16:02,400 INFO L899 garLoopResultBuilder]: For program point L6294(line 6294) no Hoare annotation was computed. [2022-10-16 13:16:02,400 INFO L899 garLoopResultBuilder]: For program point L6195(lines 6195 6200) no Hoare annotation was computed. [2022-10-16 13:16:02,400 INFO L899 garLoopResultBuilder]: For program point L6228(lines 6228 6288) no Hoare annotation was computed. [2022-10-16 13:16:02,400 INFO L895 garLoopResultBuilder]: At program point L5931(line 5931) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,400 INFO L895 garLoopResultBuilder]: At program point L5931-1(line 5931) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= ~last_index~0 15) (= ~ldv_state_variable_3~0 1) (<= 0 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3)) [2022-10-16 13:16:02,400 INFO L895 garLoopResultBuilder]: At program point L6278(line 6278) the Hoare annotation is: (and (<= ~last_index~0 15) (<= 1 ~ref_cnt~0) (<= 0 (+ ~last_index~0 2147483648)) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1) (<= 2 ~ldv_state_variable_3~0)) [2022-10-16 13:16:02,400 INFO L899 garLoopResultBuilder]: For program point L6278-1(line 6278) no Hoare annotation was computed. [2022-10-16 13:16:02,401 INFO L902 garLoopResultBuilder]: At program point rcu_is_watchingENTRY(lines 6673 6675) the Hoare annotation is: true [2022-10-16 13:16:02,401 INFO L899 garLoopResultBuilder]: For program point rcu_is_watchingEXIT(lines 6673 6675) no Hoare annotation was computed. [2022-10-16 13:16:02,401 INFO L899 garLoopResultBuilder]: For program point rcu_is_watchingFINAL(lines 6673 6675) no Hoare annotation was computed. [2022-10-16 13:16:02,401 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 5254 5259) the Hoare annotation is: true [2022-10-16 13:16:02,401 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 5254 5259) no Hoare annotation was computed. [2022-10-16 13:16:02,401 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 5254 5259) no Hoare annotation was computed. [2022-10-16 13:16:02,401 INFO L899 garLoopResultBuilder]: For program point L6687-1(line 6687) no Hoare annotation was computed. [2022-10-16 13:16:02,402 INFO L895 garLoopResultBuilder]: At program point L6687(line 6687) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 3))) (.cse1 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) (.cse3 (not (<= ~last_index~0 15)))) (and (or (not (<= 0 ~ref_cnt~0)) .cse0 .cse1 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse2 .cse3) (or (not (<= 1 ~ref_cnt~0)) (not (<= 2 ~ldv_state_variable_3~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1)) .cse2 .cse3) (or (not (= ~ref_cnt~0 0)) (not (= ~ldv_state_variable_2~0 0)) .cse1 (not (= ~ldv_state_variable_3~0 0)) .cse2 .cse3))) [2022-10-16 13:16:02,402 INFO L902 garLoopResultBuilder]: At program point L6687-2(lines 6686 6688) the Hoare annotation is: true [2022-10-16 13:16:02,402 INFO L902 garLoopResultBuilder]: At program point L5687(line 5687) the Hoare annotation is: true [2022-10-16 13:16:02,402 INFO L899 garLoopResultBuilder]: For program point L5687-1(line 5687) no Hoare annotation was computed. [2022-10-16 13:16:02,402 INFO L899 garLoopResultBuilder]: For program point cisco_hard_headerFINAL(lines 5673 5691) no Hoare annotation was computed. [2022-10-16 13:16:02,402 INFO L899 garLoopResultBuilder]: For program point L5681-2(lines 5681 5685) no Hoare annotation was computed. [2022-10-16 13:16:02,402 INFO L899 garLoopResultBuilder]: For program point L5681(lines 5681 5685) no Hoare annotation was computed. [2022-10-16 13:16:02,402 INFO L895 garLoopResultBuilder]: At program point cisco_hard_headerENTRY(lines 5673 5691) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 3))) (.cse1 (not (<= 0 (+ ~last_index~0 2147483648)))) (.cse2 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) (.cse3 (not (<= ~last_index~0 15)))) (and (or (not (<= 0 ~ref_cnt~0)) .cse0 .cse1 (not (= ~ldv_state_variable_3~0 1)) (not (<= ~ref_cnt~0 0)) .cse2 .cse3) (or (not (<= 1 ~ref_cnt~0)) (not (<= 2 ~ldv_state_variable_3~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1)) .cse2 .cse3) (or (not (= ~ref_cnt~0 0)) (not (= ~ldv_state_variable_2~0 0)) .cse1 (not (= ~ldv_state_variable_3~0 0)) .cse2 .cse3))) [2022-10-16 13:16:02,403 INFO L899 garLoopResultBuilder]: For program point cisco_hard_headerEXIT(lines 5673 5691) no Hoare annotation was computed. [2022-10-16 13:16:02,403 INFO L902 garLoopResultBuilder]: At program point dev_kfree_skb_anyENTRY(lines 5600 5606) the Hoare annotation is: true [2022-10-16 13:16:02,403 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyEXIT(lines 5600 5606) no Hoare annotation was computed. [2022-10-16 13:16:02,403 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyFINAL(lines 5600 5606) no Hoare annotation was computed. [2022-10-16 13:16:02,403 INFO L902 garLoopResultBuilder]: At program point L6596(lines 6595 6597) the Hoare annotation is: true [2022-10-16 13:16:02,407 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:16:02,410 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:16:02,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,421 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,421 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,421 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,421 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,468 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,505 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,505 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,505 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,505 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:16:02 BoogieIcfgContainer [2022-10-16 13:16:02,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:16:02,521 INFO L158 Benchmark]: Toolchain (without parser) took 207046.20ms. Allocated memory was 158.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 125.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-16 13:16:02,521 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 158.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:16:02,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2286.13ms. Allocated memory was 158.3MB in the beginning and 212.9MB in the end (delta: 54.5MB). Free memory was 125.5MB in the beginning and 171.0MB in the end (delta: -45.4MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2022-10-16 13:16:02,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 240.71ms. Allocated memory is still 212.9MB. Free memory was 171.0MB in the beginning and 162.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-16 13:16:02,522 INFO L158 Benchmark]: Boogie Preprocessor took 147.87ms. Allocated memory is still 212.9MB. Free memory was 162.6MB in the beginning and 154.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-16 13:16:02,523 INFO L158 Benchmark]: RCFGBuilder took 1778.82ms. Allocated memory is still 212.9MB. Free memory was 154.2MB in the beginning and 130.4MB in the end (delta: 23.8MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2022-10-16 13:16:02,523 INFO L158 Benchmark]: TraceAbstraction took 202573.95ms. Allocated memory was 212.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 129.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-16 13:16:02,525 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 158.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2286.13ms. Allocated memory was 158.3MB in the beginning and 212.9MB in the end (delta: 54.5MB). Free memory was 125.5MB in the beginning and 171.0MB in the end (delta: -45.4MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 240.71ms. Allocated memory is still 212.9MB. Free memory was 171.0MB in the beginning and 162.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 147.87ms. Allocated memory is still 212.9MB. Free memory was 162.6MB in the beginning and 154.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1778.82ms. Allocated memory is still 212.9MB. Free memory was 154.2MB in the beginning and 130.4MB in the end (delta: 23.8MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * TraceAbstraction took 202573.95ms. Allocated memory was 212.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 129.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 - PositiveResult [Line: 6400]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6400]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6404]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6404]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5483]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5483]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6235]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6235]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6267]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6267]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 33 procedures, 512 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 202.4s, OverallIterations: 17, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 144.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22411 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21669 mSDsluCounter, 25818 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13579 mSDsCounter, 6294 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12674 IncrementalHoareTripleChecker+Invalid, 18968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6294 mSolverCounterUnsat, 12239 mSDtfsCounter, 12674 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2806 GetRequests, 2672 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11303occurred in iteration=9, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 11655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 193 LocationsWithAnnotation, 18402 PreInvPairs, 19196 NumberOfFragments, 8570 HoareAnnotationTreeSize, 18402 FomulaSimplifications, 1064599 FormulaSimplificationTreeSizeReduction, 122.0s HoareSimplificationTime, 193 FomulaSimplificationsInter, 944414 FormulaSimplificationTreeSizeReductionInter, 21.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 3911 NumberOfCodeBlocks, 3911 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4406 ConstructedInterpolants, 0 QuantifiedInterpolants, 8037 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10430 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 3883/4070 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 6677]: Loop Invariant [2022-10-16 13:16:02,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && last_index <= 15) && \old(\valid) == \valid) && 0 <= last_index + 2147483648) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && last_index <= 15) && \old(\valid) == \valid) && 0 <= last_index + 2147483648) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1))) && (((((!(1 <= ref_cnt) || !(\old(last_index) == 0)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || last_index == 0) || !(ref_cnt <= 1))) && ((((!(ref_cnt == 0) || !(\old(last_index) == 0)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || last_index == 0) - InvariantResult [Line: 6391]: Loop Invariant Derived loop invariant: ((((((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (((last_index <= 15 && i <= 2147483646) && 0 <= i) && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (((last_index <= 15 && i <= 2147483646) && 0 <= i) && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0))) && ((((((i == 0 && last_index == 0) || !(1 <= ref_cnt)) || !(\old(last_index) == 0)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1))) && (((((i == 0 && last_index == 0) || !(ref_cnt == 0)) || !(\old(last_index) == 0)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1))) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (((last_index <= 15 && i <= 2147483646) && 0 <= i) && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && (((((i == 0 && last_index == 0) || !(ref_cnt == 0)) || !(\old(last_index) == 0)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0)) - InvariantResult [Line: 5808]: Loop Invariant [2022-10-16 13:16:02,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 6680]: Loop Invariant Derived loop invariant: (((last_index <= 15 && ldv_state_variable_2 == 0) && ref_cnt == 0) && 0 <= last_index + 2147483648) && ldv_state_variable_3 == 0 - InvariantResult [Line: 6064]: Loop Invariant Derived loop invariant: (((last_index <= 15 && ldv_state_variable_2 == 0) && ref_cnt == 0) && 0 <= last_index + 2147483648) && ldv_state_variable_3 == 0 - InvariantResult [Line: 5909]: Loop Invariant Derived loop invariant: ((((ref_cnt <= 0 && last_index <= 15) && ldv_state_variable_3 == 1) && 0 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3 - InvariantResult [Line: 6589]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6111]: Loop Invariant Derived loop invariant: ((((((ref_cnt <= 0 && last_index <= 15) && ldv_state_variable_3 == 1) && 0 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) || ((((last_index <= 15 && ldv_state_variable_2 == 0) && ref_cnt == 0) && 0 <= last_index + 2147483648) && ldv_state_variable_3 == 0)) || (((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3) - InvariantResult [Line: 6362]: Loop Invariant Derived loop invariant: ((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3 - InvariantResult [Line: 6652]: Loop Invariant [2022-10-16 13:16:02,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 6638]: Loop Invariant Derived loop invariant: ((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3 - InvariantResult [Line: 5191]: Loop Invariant Derived loop invariant: ((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6686]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6377]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 0 && ref_cnt == 0) && last_index == 0) && ldv_state_variable_3 == 0 - InvariantResult [Line: 5808]: Loop Invariant [2022-10-16 13:16:02,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 5808]: Loop Invariant [2022-10-16 13:16:02,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 5293]: Loop Invariant Derived loop invariant: ((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 5319]: Loop Invariant [2022-10-16 13:16:02,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 6592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6648]: Loop Invariant [2022-10-16 13:16:02,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 6694]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5415]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5113]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6595]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5439]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5285]: Loop Invariant [2022-10-16 13:16:02,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 6467]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6099]: Loop Invariant Derived loop invariant: ((((ref_cnt <= 0 && last_index <= 15) && ldv_state_variable_3 == 1) && 0 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3 - InvariantResult [Line: 6129]: Loop Invariant Derived loop invariant: ((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3 - InvariantResult [Line: 5138]: Loop Invariant [2022-10-16 13:16:02,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 5384]: Loop Invariant Derived loop invariant: ((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5620]: Loop Invariant Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && last_index <= 15) && \old(\valid) == \valid) && 0 <= last_index + 2147483648) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && last_index <= 15) && \old(\valid) == \valid) && 0 <= last_index + 2147483648) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1))) && (((((!(1 <= ref_cnt) || !(\old(last_index) == 0)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || last_index == 0) || !(ref_cnt <= 1))) && ((((!(ref_cnt == 0) || !(\old(last_index) == 0)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || last_index == 0) - InvariantResult [Line: 6616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6386]: Loop Invariant Derived loop invariant: ((((((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (((last_index <= 15 && i <= 2147483646) && 0 <= i) && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (((last_index <= 15 && i <= 2147483646) && 0 <= i) && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0))) && ((((!(ref_cnt == 0) || i == 0) || !(\old(last_index) == 0)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && (((((!(1 <= ref_cnt) || i == 0) || !(\old(last_index) == 0)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1))) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (((last_index <= 15 && i <= 2147483646) && 0 <= i) && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && ((((!(ref_cnt == 0) || i == 0) || !(\old(last_index) == 0)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) - InvariantResult [Line: 5357]: Loop Invariant [2022-10-16 13:16:02,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 6619]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5875]: Loop Invariant Derived loop invariant: ((((((ref_cnt <= 0 && last_index <= 15) && ldv_state_variable_3 == 1) && 0 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) || ((((last_index <= 15 && ldv_state_variable_2 == 0) && ref_cnt == 0) && 0 <= last_index + 2147483648) && ldv_state_variable_3 == 0)) || (((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3) - InvariantResult [Line: 6689]: Loop Invariant Derived loop invariant: (((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6071]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5310]: Loop Invariant Derived loop invariant: ((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6140]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5480]: Loop Invariant Derived loop invariant: (((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 5592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5645]: Loop Invariant [2022-10-16 13:16:02,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,607 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5557]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5303]: Loop Invariant [2022-10-16 13:16:02,607 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,607 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) - InvariantResult [Line: 5472]: Loop Invariant Derived loop invariant: (((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6642]: Loop Invariant Derived loop invariant: (((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6160]: Loop Invariant Derived loop invariant: ((((((ref_cnt <= 0 && last_index <= 15) && ldv_state_variable_3 == 1) && 0 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) || ((((last_index <= 15 && ldv_state_variable_2 == 0) && ref_cnt == 0) && 0 <= last_index + 2147483648) && ldv_state_variable_3 == 0)) || (((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3) - InvariantResult [Line: 6683]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6354]: Loop Invariant Derived loop invariant: (((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && (((((!(\old(last_index) <= 15) || !(ref_cnt == 0)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(ldv_state_variable_2 == 0)) || !(ldv_state_variable_3 == 0))) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6630]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6655]: Loop Invariant Derived loop invariant: ((((((!(\old(last_index) <= 15) || !(1 <= ref_cnt)) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && ((((((!(\old(last_index) <= 15) || (last_index <= 15 && 0 <= last_index + 2147483648)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) - InvariantResult [Line: 6525]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 0 && ref_cnt == 0) && last_index == 0) && ldv_state_variable_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((ref_cnt <= 0 && last_index <= 15) && ldv_state_variable_3 == 1) && 0 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) || ((((last_index <= 15 && ldv_state_variable_2 == 0) && ref_cnt == 0) && 0 <= last_index + 2147483648) && ldv_state_variable_3 == 0)) || (((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3) - InvariantResult [Line: 5940]: Loop Invariant Derived loop invariant: ((((last_index <= 15 && 1 <= ref_cnt) && 0 <= last_index + 2147483648) && ldv_state_variable_0 == 3) && ref_cnt <= 1) && 2 <= ldv_state_variable_3 - InvariantResult [Line: 6160]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5773]: Loop Invariant [2022-10-16 13:16:02,616 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-10-16 13:16:02,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-10-16 13:16:02,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(0 <= \old(last_index) + 2147483648)) || !(0 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ldv_state_variable_3 == 1)) || !(ref_cnt <= 0)) && (((((((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(last_index) == last_index) || !(\old(last_index) <= 15)) || !(1 <= ref_cnt)) || !(0 <= \old(last_index) + 2147483648)) || !(2 <= ldv_state_variable_3)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) RESULT: Ultimate proved your program to be correct! [2022-10-16 13:16:02,639 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...