./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 050fd30cd52b5257f5abb9987708941e19eb2524ff9fca178aa5cf81d315756f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:11:56,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:11:56,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:11:56,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:11:56,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:11:56,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:11:56,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:11:56,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:11:56,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:11:56,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:11:56,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:11:56,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:11:56,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:11:56,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:11:56,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:11:56,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:11:56,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:11:56,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:11:56,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:11:56,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:11:56,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:11:56,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:11:56,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:11:56,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:11:56,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:11:56,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:11:56,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:11:56,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:11:56,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:11:56,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:11:56,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:11:56,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:11:56,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:11:56,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:11:56,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:11:56,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:11:56,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:11:56,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:11:56,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:11:56,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:11:56,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:11:56,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:11:56,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:11:56,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:11:56,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:11:56,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:11:56,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:11:56,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:11:56,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:11:56,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:11:56,241 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:11:56,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:11:56,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:11:56,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:11:56,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:11:56,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:11:56,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:11:56,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:11:56,242 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:11:56,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:11:56,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:11:56,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:11:56,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:11:56,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:11:56,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:11:56,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:11:56,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:11:56,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:11:56,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:11:56,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:11:56,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:11:56,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:11:56,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 050fd30cd52b5257f5abb9987708941e19eb2524ff9fca178aa5cf81d315756f [2022-02-20 22:11:56,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:11:56,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:11:56,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:11:56,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:11:56,444 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:11:56,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i [2022-02-20 22:11:56,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5f0f997/c1dd7e74c49343119b21bb1e5a19baff/FLAG5b6f2c8db [2022-02-20 22:11:57,189 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:11:57,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i [2022-02-20 22:11:57,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5f0f997/c1dd7e74c49343119b21bb1e5a19baff/FLAG5b6f2c8db [2022-02-20 22:11:57,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5f0f997/c1dd7e74c49343119b21bb1e5a19baff [2022-02-20 22:11:57,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:11:57,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:11:57,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:11:57,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:11:57,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:11:57,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:11:57" (1/1) ... [2022-02-20 22:11:57,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6019ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:57, skipping insertion in model container [2022-02-20 22:11:57,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:11:57" (1/1) ... [2022-02-20 22:11:57,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:11:57,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:11:59,282 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i[424156,424169] [2022-02-20 22:11:59,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:11:59,328 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:11:59,687 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i[424156,424169] [2022-02-20 22:11:59,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:11:59,805 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:11:59,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59 WrapperNode [2022-02-20 22:11:59,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:11:59,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:11:59,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:11:59,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:11:59,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:11:59,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,088 INFO L137 Inliner]: procedures = 223, calls = 3404, calls flagged for inlining = 107, calls inlined = 96, statements flattened = 6421 [2022-02-20 22:12:00,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:12:00,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:12:00,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:12:00,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:12:00,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:12:00,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:12:00,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:12:00,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:12:00,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (1/1) ... [2022-02-20 22:12:00,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:12:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:12:00,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 22:12:00,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:12:00,500 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_set_fw_ps_tdma [2022-02-20 22:12:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_set_fw_ps_tdma [2022-02-20 22:12:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:12:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:12:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:12:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:12:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_read_word [2022-02-20 22:12:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_read_word [2022-02-20 22:12:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_nomal_low_power [2022-02-20 22:12:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_nomal_low_power [2022-02-20 22:12:00,502 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_read_byte [2022-02-20 22:12:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_read_byte [2022-02-20 22:12:00,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:12:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:12:00,502 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_is_wifi_uplink [2022-02-20 22:12:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_is_wifi_uplink [2022-02-20 22:12:00,502 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_write_word [2022-02-20 22:12:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_write_word [2022-02-20 22:12:00,503 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_wifioff_hwcfg [2022-02-20 22:12:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_wifioff_hwcfg [2022-02-20 22:12:00,503 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_write_byte [2022-02-20 22:12:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_write_byte [2022-02-20 22:12:00,503 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u8~0~X~~u32~0~X~$Pointer$~TO~VOID [2022-02-20 22:12:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u8~0~X~~u32~0~X~$Pointer$~TO~VOID [2022-02-20 22:12:00,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:12:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:12:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_btc_lps_notify [2022-02-20 22:12:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_btc_lps_notify [2022-02-20 22:12:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_ps_tdma [2022-02-20 22:12:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_ps_tdma [2022-02-20 22:12:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure ex_btc8723b2ant_media_status_notify [2022-02-20 22:12:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ex_btc8723b2ant_media_status_notify [2022-02-20 22:12:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:12:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_tdma_duration_adjust [2022-02-20 22:12:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_tdma_duration_adjust [2022-02-20 22:12:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_ignore_wlan_act [2022-02-20 22:12:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_ignore_wlan_act [2022-02-20 22:12:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_write_dword [2022-02-20 22:12:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_write_dword [2022-02-20 22:12:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_read_4byte [2022-02-20 22:12:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_read_4byte [2022-02-20 22:12:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:12:00,505 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_write_4byte [2022-02-20 22:12:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_write_4byte [2022-02-20 22:12:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_get_wifi_rssi [2022-02-20 22:12:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_get_wifi_rssi [2022-02-20 22:12:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~u16~0~TO~VOID [2022-02-20 22:12:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~u16~0~TO~VOID [2022-02-20 22:12:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_btc_scan_notify [2022-02-20 22:12:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_btc_scan_notify [2022-02-20 22:12:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure ex_btc8723b2ant_init_hwconfig [2022-02-20 22:12:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ex_btc8723b2ant_init_hwconfig [2022-02-20 22:12:00,506 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_leave_low_power [2022-02-20 22:12:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_leave_low_power [2022-02-20 22:12:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~u32~0~TO~VOID [2022-02-20 22:12:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~u32~0~TO~VOID [2022-02-20 22:12:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:12:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:12:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_btc_connect_notify [2022-02-20 22:12:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_btc_connect_notify [2022-02-20 22:12:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_wifi_rssi_state [2022-02-20 22:12:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_wifi_rssi_state [2022-02-20 22:12:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~u32~0~X~~u8~0~TO~VOID [2022-02-20 22:12:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~u32~0~X~~u8~0~TO~VOID [2022-02-20 22:12:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_dec_bt_pwr [2022-02-20 22:12:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_dec_bt_pwr [2022-02-20 22:12:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_set_dac_swing_reg [2022-02-20 22:12:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_set_dac_swing_reg [2022-02-20 22:12:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~TO~~u32~0 [2022-02-20 22:12:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~TO~~u32~0 [2022-02-20 22:12:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:12:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_set_ant_path [2022-02-20 22:12:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_set_ant_path [2022-02-20 22:12:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_init_coex_dm [2022-02-20 22:12:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_init_coex_dm [2022-02-20 22:12:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_coex_alloff [2022-02-20 22:12:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_coex_alloff [2022-02-20 22:12:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u8~0~X~~u32~0~X~~u32~0~X~~u32~0~TO~VOID [2022-02-20 22:12:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u8~0~X~~u32~0~X~~u32~0~X~~u32~0~TO~VOID [2022-02-20 22:12:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_bt_rssi_state [2022-02-20 22:12:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_bt_rssi_state [2022-02-20 22:12:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b_coex_tbl_type [2022-02-20 22:12:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b_coex_tbl_type [2022-02-20 22:12:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~TO~~u16~0 [2022-02-20 22:12:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~TO~~u16~0 [2022-02-20 22:12:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:12:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_enter_lps [2022-02-20 22:12:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_enter_lps [2022-02-20 22:12:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:12:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:12:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:12:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:12:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~TO~~u8~0 [2022-02-20 22:12:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~TO~~u8~0 [2022-02-20 22:12:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:12:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_read_1byte [2022-02-20 22:12:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_read_1byte [2022-02-20 22:12:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:12:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:12:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_is_bt_coexist_available [2022-02-20 22:12:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_is_bt_coexist_available [2022-02-20 22:12:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:12:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_sw_mechanism1 [2022-02-20 22:12:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_sw_mechanism1 [2022-02-20 22:12:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_sw_mechanism2 [2022-02-20 22:12:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_sw_mechanism2 [2022-02-20 22:12:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:12:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_fw_dac_swing_lvl [2022-02-20 22:12:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_fw_dac_swing_lvl [2022-02-20 22:12:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 22:12:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_fill_h2c_cmd [2022-02-20 22:12:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_fill_h2c_cmd [2022-02-20 22:12:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b_need_dec_pwr [2022-02-20 22:12:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b_need_dec_pwr [2022-02-20 22:12:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_coex_table [2022-02-20 22:12:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_coex_table [2022-02-20 22:12:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_leave_lps [2022-02-20 22:12:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_leave_lps [2022-02-20 22:12:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure btc8723b2ant_run_coexist_mechanism [2022-02-20 22:12:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure btc8723b2ant_run_coexist_mechanism [2022-02-20 22:12:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u8~0~X~$Pointer$~TO~~bool~0 [2022-02-20 22:12:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u8~0~X~$Pointer$~TO~~bool~0 [2022-02-20 22:12:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_btc_ips_notify [2022-02-20 22:12:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_btc_ips_notify [2022-02-20 22:12:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_btc_special_packet_notify [2022-02-20 22:12:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_btc_special_packet_notify [2022-02-20 22:12:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure rtl_read_dword [2022-02-20 22:12:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure rtl_read_dword [2022-02-20 22:12:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_write_2byte [2022-02-20 22:12:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_write_2byte [2022-02-20 22:12:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_read_2byte [2022-02-20 22:12:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_read_2byte [2022-02-20 22:12:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:12:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure halbtc_set [2022-02-20 22:12:00,516 INFO L138 BoogieDeclarations]: Found implementation of procedure halbtc_set [2022-02-20 22:12:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:12:00,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:12:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-02-20 22:12:00,516 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-02-20 22:12:01,014 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:12:01,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:12:02,370 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:12:06,034 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:12:06,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:12:06,060 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 22:12:06,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:12:06 BoogieIcfgContainer [2022-02-20 22:12:06,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:12:06,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:12:06,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:12:06,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:12:06,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:11:57" (1/3) ... [2022-02-20 22:12:06,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfa9505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:12:06, skipping insertion in model container [2022-02-20 22:12:06,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:11:59" (2/3) ... [2022-02-20 22:12:06,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfa9505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:12:06, skipping insertion in model container [2022-02-20 22:12:06,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:12:06" (3/3) ... [2022-02-20 22:12:06,071 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--wireless--rtlwifi--btcoexist--btcoexist.ko-entry_point.cil.out.i [2022-02-20 22:12:06,075 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:12:06,075 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:12:06,123 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:12:06,128 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:12:06,128 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:12:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 2777 states, 1915 states have (on average 1.4657963446475195) internal successors, (2807), 2027 states have internal predecessors, (2807), 798 states have call successors, (798), 63 states have call predecessors, (798), 62 states have return successors, (795), 703 states have call predecessors, (795), 795 states have call successors, (795) [2022-02-20 22:12:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 22:12:06,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:12:06,191 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:12:06,192 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:12:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:12:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1160417805, now seen corresponding path program 1 times [2022-02-20 22:12:06,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:12:06,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788317961] [2022-02-20 22:12:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:12:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:12:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:12:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:12:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {2839#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2780#true} is VALID [2022-02-20 22:12:06,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2780#true} {2780#true} #8299#return; {2780#true} is VALID [2022-02-20 22:12:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:12:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-02-20 22:12:06,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume 0 == ~cond;assume false; {2781#false} is VALID [2022-02-20 22:12:06,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#false} assume true; {2781#false} is VALID [2022-02-20 22:12:06,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#false} {2780#true} #8301#return; {2781#false} is VALID [2022-02-20 22:12:06,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {2831#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(~size); {2780#true} is VALID [2022-02-20 22:12:06,635 INFO L272 TraceCheckUtils]: 1: Hoare triple {2780#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, 1, ~size, ~size); {2839#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:12:06,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {2839#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2780#true} is VALID [2022-02-20 22:12:06,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,636 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2780#true} #8299#return; {2780#true} is VALID [2022-02-20 22:12:06,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc13.base, #t~malloc13.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2780#true} is VALID [2022-02-20 22:12:06,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2780#true} is VALID [2022-02-20 22:12:06,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-02-20 22:12:06,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume 0 == ~cond;assume false; {2781#false} is VALID [2022-02-20 22:12:06,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {2781#false} assume true; {2781#false} is VALID [2022-02-20 22:12:06,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2781#false} {2780#true} #8301#return; {2781#false} is VALID [2022-02-20 22:12:06,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {2781#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2781#false} is VALID [2022-02-20 22:12:06,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {2781#false} assume true; {2781#false} is VALID [2022-02-20 22:12:06,638 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2781#false} {2780#true} #8317#return; {2781#false} is VALID [2022-02-20 22:12:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 22:12:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,661 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8319#return; {2781#false} is VALID [2022-02-20 22:12:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:12:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,675 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8321#return; {2781#false} is VALID [2022-02-20 22:12:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 22:12:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,689 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8323#return; {2781#false} is VALID [2022-02-20 22:12:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 22:12:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,703 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8325#return; {2781#false} is VALID [2022-02-20 22:12:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 22:12:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,717 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8327#return; {2781#false} is VALID [2022-02-20 22:12:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 22:12:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,738 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8329#return; {2781#false} is VALID [2022-02-20 22:12:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 22:12:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:06,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,758 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2780#true} {2781#false} #8331#return; {2781#false} is VALID [2022-02-20 22:12:06,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {2780#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(106, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(16, 4);call #Ultimate.allocInit(24, 5);call #Ultimate.allocInit(40, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(39, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(42, 11);call #Ultimate.allocInit(37, 12);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(40, 15);call #Ultimate.allocInit(42, 16);call #Ultimate.allocInit(38, 17);call #Ultimate.allocInit(42, 18);call #Ultimate.allocInit(39, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(40, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(44, 23);call #Ultimate.allocInit(39, 24);call #Ultimate.allocInit(42, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(42, 27);call #Ultimate.allocInit(44, 28);call #Ultimate.allocInit(40, 29);call #Ultimate.allocInit(59, 30);call #Ultimate.allocInit(58, 31);call #Ultimate.allocInit(47, 32);call #Ultimate.allocInit(32, 33);call #Ultimate.allocInit(20, 34);call #Ultimate.allocInit(20, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(24, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(21, 39);call #Ultimate.allocInit(30, 40);call #Ultimate.allocInit(25, 41);call #Ultimate.allocInit(26, 42);call #Ultimate.allocInit(22, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(26, 45);call #Ultimate.allocInit(26, 46);call #Ultimate.allocInit(26, 47);call #Ultimate.allocInit(36, 48);call #Ultimate.allocInit(31, 49);call #Ultimate.allocInit(32, 50);call #Ultimate.allocInit(32, 51);call #Ultimate.allocInit(41, 52);call #Ultimate.allocInit(32, 53);call #Ultimate.allocInit(33, 54);call #Ultimate.allocInit(47, 55);call #Ultimate.allocInit(54, 56);call #Ultimate.allocInit(51, 57);call #Ultimate.allocInit(61, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(30, 60);call #Ultimate.allocInit(54, 61);call #Ultimate.allocInit(6, 62);call write~init~int(89, 62, 0, 1);call write~init~int(101, 62, 1, 1);call write~init~int(115, 62, 2, 1);call write~init~int(33, 62, 3, 1);call write~init~int(33, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(5, 63);call write~init~int(78, 63, 0, 1);call write~init~int(111, 63, 1, 1);call write~init~int(33, 63, 2, 1);call write~init~int(33, 63, 3, 1);call write~init~int(0, 63, 4, 1);call #Ultimate.allocInit(32, 64);call #Ultimate.allocInit(9, 65);call #Ultimate.allocInit(1, 66);call write~init~int(0, 66, 0, 1);call #Ultimate.allocInit(3, 67);call write~init~int(79, 67, 0, 1);call write~init~int(78, 67, 1, 1);call write~init~int(0, 67, 2, 1);call #Ultimate.allocInit(4, 68);call write~init~int(79, 68, 0, 1);call write~init~int(70, 68, 1, 1);call write~init~int(70, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(44, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(9, 71);call #Ultimate.allocInit(1, 72);call write~init~int(0, 72, 0, 1);call #Ultimate.allocInit(52, 73);call #Ultimate.allocInit(37, 74);call #Ultimate.allocInit(37, 75);call #Ultimate.allocInit(37, 76);call #Ultimate.allocInit(9, 77);call #Ultimate.allocInit(1, 78);call write~init~int(0, 78, 0, 1);call #Ultimate.allocInit(3, 79);call write~init~int(79, 79, 0, 1);call write~init~int(78, 79, 1, 1);call write~init~int(0, 79, 2, 1);call #Ultimate.allocInit(4, 80);call write~init~int(79, 80, 0, 1);call write~init~int(70, 80, 1, 1);call write~init~int(70, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(54, 81);call #Ultimate.allocInit(41, 82);call #Ultimate.allocInit(5, 83);call write~init~int(79, 83, 0, 1);call write~init~int(78, 83, 1, 1);call write~init~int(33, 83, 2, 1);call write~init~int(33, 83, 3, 1);call write~init~int(0, 83, 4, 1);call #Ultimate.allocInit(6, 84);call write~init~int(79, 84, 0, 1);call write~init~int(70, 84, 1, 1);call write~init~int(70, 84, 2, 1);call write~init~int(33, 84, 3, 1);call write~init~int(33, 84, 4, 1);call write~init~int(0, 84, 5, 1);call #Ultimate.allocInit(37, 85);call #Ultimate.allocInit(9, 86);call #Ultimate.allocInit(1, 87);call write~init~int(0, 87, 0, 1);call #Ultimate.allocInit(3, 88);call write~init~int(79, 88, 0, 1);call write~init~int(78, 88, 1, 1);call write~init~int(0, 88, 2, 1);call #Ultimate.allocInit(4, 89);call write~init~int(79, 89, 0, 1);call write~init~int(70, 89, 1, 1);call write~init~int(70, 89, 2, 1);call write~init~int(0, 89, 3, 1);call #Ultimate.allocInit(52, 90);call #Ultimate.allocInit(35, 91);call #Ultimate.allocInit(51, 92);call #Ultimate.allocInit(9, 93);call #Ultimate.allocInit(1, 94);call write~init~int(0, 94, 0, 1);call #Ultimate.allocInit(3, 95);call write~init~int(79, 95, 0, 1);call write~init~int(78, 95, 1, 1);call write~init~int(0, 95, 2, 1);call #Ultimate.allocInit(4, 96);call write~init~int(79, 96, 0, 1);call write~init~int(70, 96, 1, 1);call write~init~int(70, 96, 2, 1);call write~init~int(0, 96, 3, 1);call #Ultimate.allocInit(90, 97);call #Ultimate.allocInit(28, 98);call #Ultimate.allocInit(29, 99);call #Ultimate.allocInit(25, 100);call #Ultimate.allocInit(26, 101);call #Ultimate.allocInit(25, 102);call #Ultimate.allocInit(26, 103);call #Ultimate.allocInit(27, 104);call #Ultimate.allocInit(9, 105);call #Ultimate.allocInit(1, 106);call write~init~int(0, 106, 0, 1);call #Ultimate.allocInit(7, 107);call write~init~int(69, 107, 0, 1);call write~init~int(110, 107, 1, 1);call write~init~int(97, 107, 2, 1);call write~init~int(98, 107, 3, 1);call write~init~int(108, 107, 4, 1);call write~init~int(101, 107, 5, 1);call write~init~int(0, 107, 6, 1);call #Ultimate.allocInit(8, 108);call #Ultimate.allocInit(48, 109);call #Ultimate.allocInit(42, 110);call #Ultimate.allocInit(42, 111);call #Ultimate.allocInit(42, 112);call #Ultimate.allocInit(42, 113);call #Ultimate.allocInit(78, 114);call #Ultimate.allocInit(9, 115);call #Ultimate.allocInit(1, 116);call write~init~int(0, 116, 0, 1);call #Ultimate.allocInit(85, 117);call #Ultimate.allocInit(85, 118);call #Ultimate.allocInit(61, 119);call #Ultimate.allocInit(37, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(1, 122);call write~init~int(0, 122, 0, 1);call #Ultimate.allocInit(3, 123);call write~init~int(79, 123, 0, 1);call write~init~int(78, 123, 1, 1);call write~init~int(0, 123, 2, 1);call #Ultimate.allocInit(4, 124);call write~init~int(79, 124, 0, 1);call write~init~int(70, 124, 1, 1);call write~init~int(70, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(60, 125);call #Ultimate.allocInit(42, 126);call #Ultimate.allocInit(39, 127);call #Ultimate.allocInit(9, 128);call #Ultimate.allocInit(1, 129);call write~init~int(0, 129, 0, 1);call #Ultimate.allocInit(3, 130);call write~init~int(79, 130, 0, 1);call write~init~int(78, 130, 1, 1);call write~init~int(0, 130, 2, 1);call #Ultimate.allocInit(4, 131);call write~init~int(79, 131, 0, 1);call write~init~int(70, 131, 1, 1);call write~init~int(70, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(50, 132);call #Ultimate.allocInit(44, 133);call #Ultimate.allocInit(37, 134);call #Ultimate.allocInit(52, 135);call #Ultimate.allocInit(48, 136);call #Ultimate.allocInit(43, 137);call #Ultimate.allocInit(43, 138);call #Ultimate.allocInit(23, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(23, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(23, 143);call #Ultimate.allocInit(23, 144);call #Ultimate.allocInit(32, 145);call #Ultimate.allocInit(44, 146);call #Ultimate.allocInit(28, 147);call #Ultimate.allocInit(51, 148);call #Ultimate.allocInit(36, 149);call #Ultimate.allocInit(56, 150);call #Ultimate.allocInit(56, 151);call #Ultimate.allocInit(29, 152);call #Ultimate.allocInit(66, 153);call #Ultimate.allocInit(73, 154);call #Ultimate.allocInit(37, 155);call #Ultimate.allocInit(62, 156);call #Ultimate.allocInit(33, 157);call #Ultimate.allocInit(44, 158);call #Ultimate.allocInit(26, 159);call #Ultimate.allocInit(32, 160);call #Ultimate.allocInit(44, 161);call #Ultimate.allocInit(42, 162);call #Ultimate.allocInit(42, 163);call #Ultimate.allocInit(43, 164);call #Ultimate.allocInit(51, 165);call #Ultimate.allocInit(47, 166);call #Ultimate.allocInit(46, 167);call #Ultimate.allocInit(47, 168);call #Ultimate.allocInit(51, 169);call #Ultimate.allocInit(51, 170);call #Ultimate.allocInit(47, 171);call #Ultimate.allocInit(55, 172);call #Ultimate.allocInit(33, 173);call #Ultimate.allocInit(33, 174);call #Ultimate.allocInit(70, 175);call #Ultimate.allocInit(34, 176);call #Ultimate.allocInit(73, 177);call #Ultimate.allocInit(34, 178);call #Ultimate.allocInit(71, 179);call #Ultimate.allocInit(34, 180);call #Ultimate.allocInit(46, 181);call #Ultimate.allocInit(34, 182);call #Ultimate.allocInit(44, 183);call #Ultimate.allocInit(34, 184);call #Ultimate.allocInit(30, 185);call #Ultimate.allocInit(44, 186);call #Ultimate.allocInit(34, 187);call #Ultimate.allocInit(22, 188);call #Ultimate.allocInit(4, 189);call write~init~int(89, 189, 0, 1);call write~init~int(101, 189, 1, 1);call write~init~int(115, 189, 2, 1);call write~init~int(0, 189, 3, 1);call #Ultimate.allocInit(3, 190);call write~init~int(78, 190, 0, 1);call write~init~int(111, 190, 1, 1);call write~init~int(0, 190, 2, 1);call #Ultimate.allocInit(58, 191);call #Ultimate.allocInit(34, 192);call #Ultimate.allocInit(25, 193);call #Ultimate.allocInit(48, 194);call #Ultimate.allocInit(34, 195);call #Ultimate.allocInit(31, 196);call #Ultimate.allocInit(52, 197);call #Ultimate.allocInit(34, 198);call #Ultimate.allocInit(29, 199);call #Ultimate.allocInit(47, 200);call #Ultimate.allocInit(34, 201);call #Ultimate.allocInit(24, 202);call #Ultimate.allocInit(48, 203);call #Ultimate.allocInit(34, 204);call #Ultimate.allocInit(22, 205);call #Ultimate.allocInit(49, 206);call #Ultimate.allocInit(34, 207);call #Ultimate.allocInit(12, 208);call #Ultimate.allocInit(3, 209);call write~init~int(53, 209, 0, 1);call write~init~int(71, 209, 1, 1);call write~init~int(0, 209, 2, 1);call #Ultimate.allocInit(5, 210);call write~init~int(50, 210, 0, 1);call write~init~int(46, 210, 1, 1);call write~init~int(52, 210, 2, 1);call write~init~int(71, 210, 3, 1);call write~init~int(0, 210, 4, 1);call #Ultimate.allocInit(5, 211);call write~init~int(72, 211, 0, 1);call write~init~int(84, 211, 1, 1);call write~init~int(52, 211, 2, 1);call write~init~int(48, 211, 3, 1);call write~init~int(0, 211, 4, 1);call #Ultimate.allocInit(5, 212);call write~init~int(72, 212, 0, 1);call write~init~int(84, 212, 1, 1);call write~init~int(50, 212, 2, 1);call write~init~int(48, 212, 3, 1);call write~init~int(0, 212, 4, 1);call #Ultimate.allocInit(7, 213);call write~init~int(76, 213, 0, 1);call write~init~int(101, 213, 1, 1);call write~init~int(103, 213, 2, 1);call write~init~int(97, 213, 3, 1);call write~init~int(99, 213, 4, 1);call write~init~int(121, 213, 5, 1);call write~init~int(0, 213, 6, 1);call #Ultimate.allocInit(5, 214);call write~init~int(105, 214, 0, 1);call write~init~int(100, 214, 1, 1);call write~init~int(108, 214, 2, 1);call write~init~int(101, 214, 3, 1);call write~init~int(0, 214, 4, 1);call #Ultimate.allocInit(7, 215);call write~init~int(117, 215, 0, 1);call write~init~int(112, 215, 1, 1);call write~init~int(108, 215, 2, 1);call write~init~int(105, 215, 3, 1);call write~init~int(110, 215, 4, 1);call write~init~int(107, 215, 5, 1);call write~init~int(0, 215, 6, 1);call #Ultimate.allocInit(9, 216);call #Ultimate.allocInit(54, 217);call #Ultimate.allocInit(34, 218);call #Ultimate.allocInit(17, 219);call #Ultimate.allocInit(39, 220);call #Ultimate.allocInit(34, 221);call #Ultimate.allocInit(18, 222);call #Ultimate.allocInit(11, 223);call #Ultimate.allocInit(9, 224);call #Ultimate.allocInit(75, 225);call #Ultimate.allocInit(34, 226);call #Ultimate.allocInit(42, 227);call #Ultimate.allocInit(34, 228);call #Ultimate.allocInit(18, 229);call #Ultimate.allocInit(7, 230);call write~init~int(73, 230, 0, 1);call write~init~int(80, 230, 1, 1);call write~init~int(83, 230, 2, 1);call write~init~int(32, 230, 3, 1);call write~init~int(79, 230, 4, 1);call write~init~int(78, 230, 5, 1);call write~init~int(0, 230, 6, 1);call #Ultimate.allocInit(8, 231);call #Ultimate.allocInit(7, 232);call write~init~int(76, 232, 0, 1);call write~init~int(80, 232, 1, 1);call write~init~int(83, 232, 2, 1);call write~init~int(32, 232, 3, 1);call write~init~int(79, 232, 4, 1);call write~init~int(78, 232, 5, 1);call write~init~int(0, 232, 6, 1);call #Ultimate.allocInit(8, 233);call #Ultimate.allocInit(34, 234);call #Ultimate.allocInit(34, 235);call #Ultimate.allocInit(39, 236);call #Ultimate.allocInit(48, 237);call #Ultimate.allocInit(34, 238);call #Ultimate.allocInit(24, 239);call #Ultimate.allocInit(54, 240);call #Ultimate.allocInit(34, 241);call #Ultimate.allocInit(33, 242);call #Ultimate.allocInit(34, 243);call #Ultimate.allocInit(34, 244);call #Ultimate.allocInit(39, 245);call #Ultimate.allocInit(79, 246);call #Ultimate.allocInit(34, 247);call #Ultimate.allocInit(8, 248);call #Ultimate.allocInit(44, 249);call #Ultimate.allocInit(34, 250);call #Ultimate.allocInit(21, 251);call #Ultimate.allocInit(34, 252);call #Ultimate.allocInit(34, 253);call #Ultimate.allocInit(37, 254);call #Ultimate.allocInit(41, 255);call #Ultimate.allocInit(34, 256);call #Ultimate.allocInit(19, 257);call #Ultimate.allocInit(47, 258);call #Ultimate.allocInit(34, 259);call #Ultimate.allocInit(19, 260);call #Ultimate.allocInit(53, 261);call #Ultimate.allocInit(34, 262);call #Ultimate.allocInit(23, 263);call #Ultimate.allocInit(53, 264);call #Ultimate.allocInit(34, 265);call #Ultimate.allocInit(34, 266);call #Ultimate.allocInit(59, 267);call #Ultimate.allocInit(34, 268);call #Ultimate.allocInit(34, 269);call #Ultimate.allocInit(47, 270);call #Ultimate.allocInit(34, 271);call #Ultimate.allocInit(22, 272);call #Ultimate.allocInit(47, 273);call #Ultimate.allocInit(34, 274);call #Ultimate.allocInit(28, 275);call #Ultimate.allocInit(53, 276);call #Ultimate.allocInit(34, 277);call #Ultimate.allocInit(24, 278);call #Ultimate.allocInit(59, 279);call #Ultimate.allocInit(34, 280);call #Ultimate.allocInit(35, 281);call #Ultimate.allocInit(43, 282);call #Ultimate.allocInit(34, 283);call #Ultimate.allocInit(22, 284);call #Ultimate.allocInit(43, 285);call #Ultimate.allocInit(34, 286);call #Ultimate.allocInit(21, 287);call #Ultimate.allocInit(28, 288);call #Ultimate.allocInit(28, 289);call #Ultimate.allocInit(29, 290);call #Ultimate.allocInit(30, 291);call #Ultimate.allocInit(29, 292);call #Ultimate.allocInit(30, 293);call #Ultimate.allocInit(32, 294);call #Ultimate.allocInit(33, 295);call #Ultimate.allocInit(32, 296);call #Ultimate.allocInit(35, 297);call #Ultimate.allocInit(30, 298);call #Ultimate.allocInit(30, 299);call #Ultimate.allocInit(45, 300);call #Ultimate.allocInit(9, 301);call #Ultimate.allocInit(9, 302);call #Ultimate.allocInit(54, 303);call #Ultimate.allocInit(61, 304);call #Ultimate.allocInit(70, 305);call #Ultimate.allocInit(52, 306);call #Ultimate.allocInit(48, 307);call #Ultimate.allocInit(42, 308);call #Ultimate.allocInit(42, 309);call #Ultimate.allocInit(51, 310);call #Ultimate.allocInit(23, 311);call #Ultimate.allocInit(75, 312);call #Ultimate.allocInit(76, 313);call #Ultimate.allocInit(54, 314);call #Ultimate.allocInit(43, 315);call #Ultimate.allocInit(4, 316);call write~init~int(89, 316, 0, 1);call write~init~int(101, 316, 1, 1);call write~init~int(115, 316, 2, 1);call write~init~int(0, 316, 3, 1);call #Ultimate.allocInit(3, 317);call write~init~int(78, 317, 0, 1);call write~init~int(111, 317, 1, 1);call write~init~int(0, 317, 2, 1);call #Ultimate.allocInit(61, 318);call #Ultimate.allocInit(76, 319);call #Ultimate.allocInit(40, 320);call #Ultimate.allocInit(63, 321);call #Ultimate.allocInit(63, 322);call #Ultimate.allocInit(43, 323);call #Ultimate.allocInit(22, 324);call #Ultimate.allocInit(22, 325);call #Ultimate.allocInit(45, 326);call #Ultimate.allocInit(22, 327);call #Ultimate.allocInit(22, 328);call #Ultimate.allocInit(44, 329);call #Ultimate.allocInit(22, 330);call #Ultimate.allocInit(22, 331);~LDV_IN_INTERRUPT~0 := 1;~#glcoex_dm_8723b_2ant~0.base, ~#glcoex_dm_8723b_2ant~0.offset := 332, 0;call #Ultimate.allocInit(78, 332);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#glcoex_dm_8723b_2ant~0.base);~coex_dm~0.base, ~coex_dm~0.offset := ~#glcoex_dm_8723b_2ant~0.base, ~#glcoex_dm_8723b_2ant~0.offset;~#glcoex_sta_8723b_2ant~0.base, ~#glcoex_sta_8723b_2ant~0.offset := 333, 0;call #Ultimate.allocInit(75, 333);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#glcoex_sta_8723b_2ant~0.base);~coex_sta~0.base, ~coex_sta~0.offset := ~#glcoex_sta_8723b_2ant~0.base, ~#glcoex_sta_8723b_2ant~0.offset;~#glbt_info_src_8723b_2ant~0.base, ~#glbt_info_src_8723b_2ant~0.offset := 334, 0;call #Ultimate.allocInit(24, 334);call write~init~$Pointer$(3, 0, ~#glbt_info_src_8723b_2ant~0.base, ~#glbt_info_src_8723b_2ant~0.offset, 8);call write~init~$Pointer$(4, 0, ~#glbt_info_src_8723b_2ant~0.base, 8 + ~#glbt_info_src_8723b_2ant~0.offset, 8);call write~init~$Pointer$(5, 0, ~#glbt_info_src_8723b_2ant~0.base, 16 + ~#glbt_info_src_8723b_2ant~0.offset, 8);~glcoex_ver_date_8723b_2ant~0 := 20131113;~glcoex_ver_8723b_2ant~0 := 63;~#btc_dbg_type~0.base, ~#btc_dbg_type~0.offset := 335, 0;call #Ultimate.allocInit(8, 335);call write~init~int(0, ~#btc_dbg_type~0.base, ~#btc_dbg_type~0.offset, 4);call write~init~int(0, ~#btc_dbg_type~0.base, 4 + ~#btc_dbg_type~0.offset, 4);~#gl_bt_coexist~0.base, ~#gl_bt_coexist~0.offset := 336, 0;call #Ultimate.allocInit(255, 336);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#gl_bt_coexist~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#gl_bt_coexist~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#gl_bt_coexist~0.base);~ldv_state_variable_1~0 := 0;~rtl_btc_operation_group0~0.base, ~rtl_btc_operation_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~#rtl_btc_operation~0.base, ~#rtl_btc_operation~0.offset := 337, 0;call #Ultimate.allocInit(120, 337);call write~init~$Pointer$(#funAddr~rtl_btc_init_variables.base, #funAddr~rtl_btc_init_variables.offset, ~#rtl_btc_operation~0.base, ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_init_hal_vars.base, #funAddr~rtl_btc_init_hal_vars.offset, ~#rtl_btc_operation~0.base, 8 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_init_hw_config.base, #funAddr~rtl_btc_init_hw_config.offset, ~#rtl_btc_operation~0.base, 16 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_ips_notify.base, #funAddr~rtl_btc_ips_notify.offset, ~#rtl_btc_operation~0.base, 24 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_lps_notify.base, #funAddr~rtl_btc_lps_notify.offset, ~#rtl_btc_operation~0.base, 32 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_scan_notify.base, #funAddr~rtl_btc_scan_notify.offset, ~#rtl_btc_operation~0.base, 40 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_connect_notify.base, #funAddr~rtl_btc_connect_notify.offset, ~#rtl_btc_operation~0.base, 48 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_mediastatus_notify.base, #funAddr~rtl_btc_mediastatus_notify.offset, ~#rtl_btc_operation~0.base, 56 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_periodical.base, #funAddr~rtl_btc_periodical.offset, ~#rtl_btc_operation~0.base, 64 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_halt_notify.base, #funAddr~rtl_btc_halt_notify.offset, ~#rtl_btc_operation~0.base, 72 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_btinfo_notify.base, #funAddr~rtl_btc_btinfo_notify.offset, ~#rtl_btc_operation~0.base, 80 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_is_limited_dig.base, #funAddr~rtl_btc_is_limited_dig.offset, ~#rtl_btc_operation~0.base, 88 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_is_disable_edca_turbo.base, #funAddr~rtl_btc_is_disable_edca_turbo.offset, ~#rtl_btc_operation~0.base, 96 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_is_bt_disabled.base, #funAddr~rtl_btc_is_bt_disabled.offset, ~#rtl_btc_operation~0.base, 104 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_special_packet_notify.base, #funAddr~rtl_btc_special_packet_notify.offset, ~#rtl_btc_operation~0.base, 112 + ~#rtl_btc_operation~0.offset, 8);~#__kstrtab_rtl_btc_get_ops_pointer~0.base, ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset := 338, 0;call #Ultimate.allocInit(24, 338);call write~init~int(114, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 1 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(108, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 2 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 3 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(98, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 4 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 5 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(99, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 6 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 7 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(103, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 8 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(101, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 9 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 10 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 11 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(111, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 12 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(112, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 13 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(115, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 14 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 15 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(112, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 16 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(111, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 17 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(105, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 18 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(110, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 19 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 20 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(101, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 21 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(114, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 22 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(0, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 23 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);~__ksymtab_rtl_btc_get_ops_pointer~0.value := #funAddr~rtl_btc_get_ops_pointer.base + #funAddr~rtl_btc_get_ops_pointer.offset;~__ksymtab_rtl_btc_get_ops_pointer~0.name.base, ~__ksymtab_rtl_btc_get_ops_pointer~0.name.offset := ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset;~ldv_retval_0~0 := 0;~ldv_module_refcounter~0 := 1; {2780#true} is VALID [2022-02-20 22:12:06,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2672#1.base, main_#t~ret2672#1.offset, main_#t~ret2673#1.base, main_#t~ret2673#1.offset, main_#t~ret2674#1.base, main_#t~ret2674#1.offset, main_#t~ret2675#1.base, main_#t~ret2675#1.offset, main_#t~ret2676#1.base, main_#t~ret2676#1.offset, main_#t~ret2677#1.base, main_#t~ret2677#1.offset, main_#t~ret2678#1.base, main_#t~ret2678#1.offset, main_#t~ret2679#1.base, main_#t~ret2679#1.offset, main_#t~nondet2680#1, main_#t~switch2681#1, main_#t~nondet2682#1, main_#t~switch2683#1, main_#t~mem2684#1, main_#t~mem2685#1, main_#t~mem2686#1, main_#t~mem2687#1, main_#t~ret2688#1, main_#t~ret2689#1, main_#t~mem2690#1, main_#t~ret2691#1, main_#t~mem2692#1, main_#t~mem2693#1, main_#t~nondet2694#1, main_#t~switch2695#1, main_#t~ret2696#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp~93#1.base, main_~tmp~93#1.offset, main_~tmp___0~57#1, main_~tmp___1~18#1, main_~tmp___2~15#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp~93#1.base, main_~tmp~93#1.offset;havoc main_~tmp___0~57#1;havoc main_~tmp___1~18#1;havoc main_~tmp___2~15#1; {2780#true} is VALID [2022-02-20 22:12:06,762 INFO L272 TraceCheckUtils]: 2: Hoare triple {2780#true} call main_#t~ret2672#1.base, main_#t~ret2672#1.offset := ldv_init_zalloc(1); {2831#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:12:06,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {2831#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(~size); {2780#true} is VALID [2022-02-20 22:12:06,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, 1, ~size, ~size); {2839#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:12:06,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {2839#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2780#true} is VALID [2022-02-20 22:12:06,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,763 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2780#true} {2780#true} #8299#return; {2780#true} is VALID [2022-02-20 22:12:06,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc13.base, #t~malloc13.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2780#true} is VALID [2022-02-20 22:12:06,764 INFO L272 TraceCheckUtils]: 9: Hoare triple {2780#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2780#true} is VALID [2022-02-20 22:12:06,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-02-20 22:12:06,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume 0 == ~cond;assume false; {2781#false} is VALID [2022-02-20 22:12:06,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {2781#false} assume true; {2781#false} is VALID [2022-02-20 22:12:06,764 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2781#false} {2780#true} #8301#return; {2781#false} is VALID [2022-02-20 22:12:06,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {2781#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2781#false} is VALID [2022-02-20 22:12:06,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume true; {2781#false} is VALID [2022-02-20 22:12:06,765 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2781#false} {2780#true} #8317#return; {2781#false} is VALID [2022-02-20 22:12:06,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} main_~tmp~93#1.base, main_~tmp~93#1.offset := main_#t~ret2672#1.base, main_#t~ret2672#1.offset;havoc main_#t~ret2672#1.base, main_#t~ret2672#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp~93#1.base, main_~tmp~93#1.offset;assume { :begin_inline_ldv_initialize } true; {2781#false} is VALID [2022-02-20 22:12:06,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume { :end_inline_ldv_initialize } true; {2781#false} is VALID [2022-02-20 22:12:06,766 INFO L272 TraceCheckUtils]: 19: Hoare triple {2781#false} call main_#t~ret2673#1.base, main_#t~ret2673#1.offset := ldv_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,767 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2780#true} {2781#false} #8319#return; {2781#false} is VALID [2022-02-20 22:12:06,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {2781#false} havoc main_#t~ret2673#1.base, main_#t~ret2673#1.offset; {2781#false} is VALID [2022-02-20 22:12:06,767 INFO L272 TraceCheckUtils]: 26: Hoare triple {2781#false} call main_#t~ret2674#1.base, main_#t~ret2674#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,768 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2780#true} {2781#false} #8321#return; {2781#false} is VALID [2022-02-20 22:12:06,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {2781#false} havoc main_#t~ret2674#1.base, main_#t~ret2674#1.offset; {2781#false} is VALID [2022-02-20 22:12:06,768 INFO L272 TraceCheckUtils]: 33: Hoare triple {2781#false} call main_#t~ret2675#1.base, main_#t~ret2675#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 1); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,769 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2780#true} {2781#false} #8323#return; {2781#false} is VALID [2022-02-20 22:12:06,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {2781#false} havoc main_#t~ret2675#1.base, main_#t~ret2675#1.offset; {2781#false} is VALID [2022-02-20 22:12:06,770 INFO L272 TraceCheckUtils]: 40: Hoare triple {2781#false} call main_#t~ret2676#1.base, main_#t~ret2676#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,770 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2780#true} {2781#false} #8325#return; {2781#false} is VALID [2022-02-20 22:12:06,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {2781#false} havoc main_#t~ret2676#1.base, main_#t~ret2676#1.offset; {2781#false} is VALID [2022-02-20 22:12:06,771 INFO L272 TraceCheckUtils]: 47: Hoare triple {2781#false} call main_#t~ret2677#1.base, main_#t~ret2677#1.offset := ldv_memset(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset, 0, 1); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,772 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2780#true} {2781#false} #8327#return; {2781#false} is VALID [2022-02-20 22:12:06,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {2781#false} havoc main_#t~ret2677#1.base, main_#t~ret2677#1.offset; {2781#false} is VALID [2022-02-20 22:12:06,783 INFO L272 TraceCheckUtils]: 54: Hoare triple {2781#false} call main_#t~ret2678#1.base, main_#t~ret2678#1.offset := ldv_memset(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 1); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,784 INFO L290 TraceCheckUtils]: 58: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,784 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2780#true} {2781#false} #8329#return; {2781#false} is VALID [2022-02-20 22:12:06,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {2781#false} havoc main_#t~ret2678#1.base, main_#t~ret2678#1.offset; {2781#false} is VALID [2022-02-20 22:12:06,784 INFO L272 TraceCheckUtils]: 61: Hoare triple {2781#false} call main_#t~ret2679#1.base, main_#t~ret2679#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 1); {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:06,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {2840#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {2780#true} is VALID [2022-02-20 22:12:06,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {2780#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {2780#true} is VALID [2022-02-20 22:12:06,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {2780#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {2780#true} is VALID [2022-02-20 22:12:06,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-02-20 22:12:06,785 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2780#true} {2781#false} #8331#return; {2781#false} is VALID [2022-02-20 22:12:06,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {2781#false} havoc main_#t~ret2679#1.base, main_#t~ret2679#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {2781#false} is VALID [2022-02-20 22:12:06,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {2781#false} assume -2147483648 <= main_#t~nondet2680#1 && main_#t~nondet2680#1 <= 2147483647;main_~tmp___0~57#1 := main_#t~nondet2680#1;havoc main_#t~nondet2680#1;main_#t~switch2681#1 := 0 == main_~tmp___0~57#1; {2781#false} is VALID [2022-02-20 22:12:06,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {2781#false} assume !main_#t~switch2681#1;main_#t~switch2681#1 := main_#t~switch2681#1 || 1 == main_~tmp___0~57#1; {2781#false} is VALID [2022-02-20 22:12:06,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {2781#false} assume main_#t~switch2681#1; {2781#false} is VALID [2022-02-20 22:12:06,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {2781#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet2694#1 && main_#t~nondet2694#1 <= 2147483647;main_~tmp___2~15#1 := main_#t~nondet2694#1;havoc main_#t~nondet2694#1;main_#t~switch2695#1 := 0 == main_~tmp___2~15#1; {2781#false} is VALID [2022-02-20 22:12:06,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {2781#false} assume main_#t~switch2695#1; {2781#false} is VALID [2022-02-20 22:12:06,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {2781#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_rtl_btcoexist_module_exit } true; {2781#false} is VALID [2022-02-20 22:12:06,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {2781#false} assume { :end_inline_rtl_btcoexist_module_exit } true;~ldv_state_variable_0~0 := 2; {2781#false} is VALID [2022-02-20 22:12:06,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {2781#false} assume { :begin_inline_ldv_check_final_state } true; {2781#false} is VALID [2022-02-20 22:12:06,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {2781#false} assume 1 != ~ldv_module_refcounter~0; {2781#false} is VALID [2022-02-20 22:12:06,787 INFO L272 TraceCheckUtils]: 77: Hoare triple {2781#false} call ldv_error(); {2781#false} is VALID [2022-02-20 22:12:06,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-02-20 22:12:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-02-20 22:12:06,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:12:06,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788317961] [2022-02-20 22:12:06,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788317961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:12:06,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:12:06,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:12:06,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570979554] [2022-02-20 22:12:06,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:12:06,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2022-02-20 22:12:06,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:12:06,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 22:12:06,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:12:06,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:12:06,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:12:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:12:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:12:06,898 INFO L87 Difference]: Start difference. First operand has 2777 states, 1915 states have (on average 1.4657963446475195) internal successors, (2807), 2027 states have internal predecessors, (2807), 798 states have call successors, (798), 63 states have call predecessors, (798), 62 states have return successors, (795), 703 states have call predecessors, (795), 795 states have call successors, (795) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 22:12:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:12:29,473 INFO L93 Difference]: Finished difference Result 5507 states and 8881 transitions. [2022-02-20 22:12:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:12:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2022-02-20 22:12:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:12:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 22:12:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8881 transitions. [2022-02-20 22:12:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 22:12:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8881 transitions. [2022-02-20 22:12:30,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8881 transitions. [2022-02-20 22:12:35,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8881 edges. 8881 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:12:36,459 INFO L225 Difference]: With dead ends: 5507 [2022-02-20 22:12:36,459 INFO L226 Difference]: Without dead ends: 2720 [2022-02-20 22:12:36,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:12:36,505 INFO L933 BasicCegarLoop]: 4013 mSDtfsCounter, 1259 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 2919 mSolverCounterSat, 1819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 7772 SdHoareTripleChecker+Invalid, 4738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1819 IncrementalHoareTripleChecker+Valid, 2919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-02-20 22:12:36,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 7772 Invalid, 4738 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1819 Valid, 2919 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-02-20 22:12:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2022-02-20 22:12:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2416. [2022-02-20 22:12:36,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:12:36,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2720 states. Second operand has 2416 states, 1693 states have (on average 1.4571766095688128) internal successors, (2467), 1771 states have internal predecessors, (2467), 679 states have call successors, (679), 44 states have call predecessors, (679), 43 states have return successors, (678), 611 states have call predecessors, (678), 678 states have call successors, (678) [2022-02-20 22:12:36,719 INFO L74 IsIncluded]: Start isIncluded. First operand 2720 states. Second operand has 2416 states, 1693 states have (on average 1.4571766095688128) internal successors, (2467), 1771 states have internal predecessors, (2467), 679 states have call successors, (679), 44 states have call predecessors, (679), 43 states have return successors, (678), 611 states have call predecessors, (678), 678 states have call successors, (678) [2022-02-20 22:12:36,727 INFO L87 Difference]: Start difference. First operand 2720 states. Second operand has 2416 states, 1693 states have (on average 1.4571766095688128) internal successors, (2467), 1771 states have internal predecessors, (2467), 679 states have call successors, (679), 44 states have call predecessors, (679), 43 states have return successors, (678), 611 states have call predecessors, (678), 678 states have call successors, (678) [2022-02-20 22:12:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:12:37,084 INFO L93 Difference]: Finished difference Result 2720 states and 4456 transitions. [2022-02-20 22:12:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4456 transitions. [2022-02-20 22:12:37,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:12:37,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:12:37,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 2416 states, 1693 states have (on average 1.4571766095688128) internal successors, (2467), 1771 states have internal predecessors, (2467), 679 states have call successors, (679), 44 states have call predecessors, (679), 43 states have return successors, (678), 611 states have call predecessors, (678), 678 states have call successors, (678) Second operand 2720 states. [2022-02-20 22:12:37,186 INFO L87 Difference]: Start difference. First operand has 2416 states, 1693 states have (on average 1.4571766095688128) internal successors, (2467), 1771 states have internal predecessors, (2467), 679 states have call successors, (679), 44 states have call predecessors, (679), 43 states have return successors, (678), 611 states have call predecessors, (678), 678 states have call successors, (678) Second operand 2720 states. [2022-02-20 22:12:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:12:37,586 INFO L93 Difference]: Finished difference Result 2720 states and 4456 transitions. [2022-02-20 22:12:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4456 transitions. [2022-02-20 22:12:37,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:12:37,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:12:37,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:12:37,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:12:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1693 states have (on average 1.4571766095688128) internal successors, (2467), 1771 states have internal predecessors, (2467), 679 states have call successors, (679), 44 states have call predecessors, (679), 43 states have return successors, (678), 611 states have call predecessors, (678), 678 states have call successors, (678) [2022-02-20 22:12:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3824 transitions. [2022-02-20 22:12:37,946 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3824 transitions. Word has length 79 [2022-02-20 22:12:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:12:37,947 INFO L470 AbstractCegarLoop]: Abstraction has 2416 states and 3824 transitions. [2022-02-20 22:12:37,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 22:12:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3824 transitions. [2022-02-20 22:12:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 22:12:37,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:12:37,950 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:12:37,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:12:37,950 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:12:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:12:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash -206477647, now seen corresponding path program 1 times [2022-02-20 22:12:37,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:12:37,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403832120] [2022-02-20 22:12:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:12:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:12:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:12:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:12:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {19062#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19002#true} is VALID [2022-02-20 22:12:38,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19002#true} {19002#true} #8299#return; {19002#true} is VALID [2022-02-20 22:12:38,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:12:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {19002#true} ~cond := #in~cond; {19002#true} is VALID [2022-02-20 22:12:38,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(0 == ~cond); {19002#true} is VALID [2022-02-20 22:12:38,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19002#true} {19002#true} #8301#return; {19002#true} is VALID [2022-02-20 22:12:38,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {19054#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(~size); {19002#true} is VALID [2022-02-20 22:12:38,238 INFO L272 TraceCheckUtils]: 1: Hoare triple {19002#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, 1, ~size, ~size); {19062#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:12:38,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {19062#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19002#true} is VALID [2022-02-20 22:12:38,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,238 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8299#return; {19002#true} is VALID [2022-02-20 22:12:38,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {19002#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc13.base, #t~malloc13.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {19002#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {19002#true} ~cond := #in~cond; {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {19002#true} assume !(0 == ~cond); {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19002#true} {19002#true} #8301#return; {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {19002#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {19002#true} is VALID [2022-02-20 22:12:38,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,240 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {19002#true} {19002#true} #8317#return; {19002#true} is VALID [2022-02-20 22:12:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 22:12:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,258 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8319#return; {19002#true} is VALID [2022-02-20 22:12:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:12:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,270 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8321#return; {19002#true} is VALID [2022-02-20 22:12:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 22:12:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,282 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8323#return; {19002#true} is VALID [2022-02-20 22:12:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 22:12:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,293 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8325#return; {19002#true} is VALID [2022-02-20 22:12:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 22:12:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,307 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8327#return; {19002#true} is VALID [2022-02-20 22:12:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 22:12:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,319 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8329#return; {19002#true} is VALID [2022-02-20 22:12:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 22:12:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:12:38,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,330 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19002#true} {19002#true} #8331#return; {19002#true} is VALID [2022-02-20 22:12:38,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {19002#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(106, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(16, 4);call #Ultimate.allocInit(24, 5);call #Ultimate.allocInit(40, 6);call #Ultimate.allocInit(37, 7);call #Ultimate.allocInit(39, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(42, 11);call #Ultimate.allocInit(37, 12);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(40, 15);call #Ultimate.allocInit(42, 16);call #Ultimate.allocInit(38, 17);call #Ultimate.allocInit(42, 18);call #Ultimate.allocInit(39, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(40, 21);call #Ultimate.allocInit(36, 22);call #Ultimate.allocInit(44, 23);call #Ultimate.allocInit(39, 24);call #Ultimate.allocInit(42, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(42, 27);call #Ultimate.allocInit(44, 28);call #Ultimate.allocInit(40, 29);call #Ultimate.allocInit(59, 30);call #Ultimate.allocInit(58, 31);call #Ultimate.allocInit(47, 32);call #Ultimate.allocInit(32, 33);call #Ultimate.allocInit(20, 34);call #Ultimate.allocInit(20, 35);call #Ultimate.allocInit(21, 36);call #Ultimate.allocInit(24, 37);call #Ultimate.allocInit(25, 38);call #Ultimate.allocInit(21, 39);call #Ultimate.allocInit(30, 40);call #Ultimate.allocInit(25, 41);call #Ultimate.allocInit(26, 42);call #Ultimate.allocInit(22, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(26, 45);call #Ultimate.allocInit(26, 46);call #Ultimate.allocInit(26, 47);call #Ultimate.allocInit(36, 48);call #Ultimate.allocInit(31, 49);call #Ultimate.allocInit(32, 50);call #Ultimate.allocInit(32, 51);call #Ultimate.allocInit(41, 52);call #Ultimate.allocInit(32, 53);call #Ultimate.allocInit(33, 54);call #Ultimate.allocInit(47, 55);call #Ultimate.allocInit(54, 56);call #Ultimate.allocInit(51, 57);call #Ultimate.allocInit(61, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(30, 60);call #Ultimate.allocInit(54, 61);call #Ultimate.allocInit(6, 62);call write~init~int(89, 62, 0, 1);call write~init~int(101, 62, 1, 1);call write~init~int(115, 62, 2, 1);call write~init~int(33, 62, 3, 1);call write~init~int(33, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(5, 63);call write~init~int(78, 63, 0, 1);call write~init~int(111, 63, 1, 1);call write~init~int(33, 63, 2, 1);call write~init~int(33, 63, 3, 1);call write~init~int(0, 63, 4, 1);call #Ultimate.allocInit(32, 64);call #Ultimate.allocInit(9, 65);call #Ultimate.allocInit(1, 66);call write~init~int(0, 66, 0, 1);call #Ultimate.allocInit(3, 67);call write~init~int(79, 67, 0, 1);call write~init~int(78, 67, 1, 1);call write~init~int(0, 67, 2, 1);call #Ultimate.allocInit(4, 68);call write~init~int(79, 68, 0, 1);call write~init~int(70, 68, 1, 1);call write~init~int(70, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(44, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(9, 71);call #Ultimate.allocInit(1, 72);call write~init~int(0, 72, 0, 1);call #Ultimate.allocInit(52, 73);call #Ultimate.allocInit(37, 74);call #Ultimate.allocInit(37, 75);call #Ultimate.allocInit(37, 76);call #Ultimate.allocInit(9, 77);call #Ultimate.allocInit(1, 78);call write~init~int(0, 78, 0, 1);call #Ultimate.allocInit(3, 79);call write~init~int(79, 79, 0, 1);call write~init~int(78, 79, 1, 1);call write~init~int(0, 79, 2, 1);call #Ultimate.allocInit(4, 80);call write~init~int(79, 80, 0, 1);call write~init~int(70, 80, 1, 1);call write~init~int(70, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(54, 81);call #Ultimate.allocInit(41, 82);call #Ultimate.allocInit(5, 83);call write~init~int(79, 83, 0, 1);call write~init~int(78, 83, 1, 1);call write~init~int(33, 83, 2, 1);call write~init~int(33, 83, 3, 1);call write~init~int(0, 83, 4, 1);call #Ultimate.allocInit(6, 84);call write~init~int(79, 84, 0, 1);call write~init~int(70, 84, 1, 1);call write~init~int(70, 84, 2, 1);call write~init~int(33, 84, 3, 1);call write~init~int(33, 84, 4, 1);call write~init~int(0, 84, 5, 1);call #Ultimate.allocInit(37, 85);call #Ultimate.allocInit(9, 86);call #Ultimate.allocInit(1, 87);call write~init~int(0, 87, 0, 1);call #Ultimate.allocInit(3, 88);call write~init~int(79, 88, 0, 1);call write~init~int(78, 88, 1, 1);call write~init~int(0, 88, 2, 1);call #Ultimate.allocInit(4, 89);call write~init~int(79, 89, 0, 1);call write~init~int(70, 89, 1, 1);call write~init~int(70, 89, 2, 1);call write~init~int(0, 89, 3, 1);call #Ultimate.allocInit(52, 90);call #Ultimate.allocInit(35, 91);call #Ultimate.allocInit(51, 92);call #Ultimate.allocInit(9, 93);call #Ultimate.allocInit(1, 94);call write~init~int(0, 94, 0, 1);call #Ultimate.allocInit(3, 95);call write~init~int(79, 95, 0, 1);call write~init~int(78, 95, 1, 1);call write~init~int(0, 95, 2, 1);call #Ultimate.allocInit(4, 96);call write~init~int(79, 96, 0, 1);call write~init~int(70, 96, 1, 1);call write~init~int(70, 96, 2, 1);call write~init~int(0, 96, 3, 1);call #Ultimate.allocInit(90, 97);call #Ultimate.allocInit(28, 98);call #Ultimate.allocInit(29, 99);call #Ultimate.allocInit(25, 100);call #Ultimate.allocInit(26, 101);call #Ultimate.allocInit(25, 102);call #Ultimate.allocInit(26, 103);call #Ultimate.allocInit(27, 104);call #Ultimate.allocInit(9, 105);call #Ultimate.allocInit(1, 106);call write~init~int(0, 106, 0, 1);call #Ultimate.allocInit(7, 107);call write~init~int(69, 107, 0, 1);call write~init~int(110, 107, 1, 1);call write~init~int(97, 107, 2, 1);call write~init~int(98, 107, 3, 1);call write~init~int(108, 107, 4, 1);call write~init~int(101, 107, 5, 1);call write~init~int(0, 107, 6, 1);call #Ultimate.allocInit(8, 108);call #Ultimate.allocInit(48, 109);call #Ultimate.allocInit(42, 110);call #Ultimate.allocInit(42, 111);call #Ultimate.allocInit(42, 112);call #Ultimate.allocInit(42, 113);call #Ultimate.allocInit(78, 114);call #Ultimate.allocInit(9, 115);call #Ultimate.allocInit(1, 116);call write~init~int(0, 116, 0, 1);call #Ultimate.allocInit(85, 117);call #Ultimate.allocInit(85, 118);call #Ultimate.allocInit(61, 119);call #Ultimate.allocInit(37, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(1, 122);call write~init~int(0, 122, 0, 1);call #Ultimate.allocInit(3, 123);call write~init~int(79, 123, 0, 1);call write~init~int(78, 123, 1, 1);call write~init~int(0, 123, 2, 1);call #Ultimate.allocInit(4, 124);call write~init~int(79, 124, 0, 1);call write~init~int(70, 124, 1, 1);call write~init~int(70, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(60, 125);call #Ultimate.allocInit(42, 126);call #Ultimate.allocInit(39, 127);call #Ultimate.allocInit(9, 128);call #Ultimate.allocInit(1, 129);call write~init~int(0, 129, 0, 1);call #Ultimate.allocInit(3, 130);call write~init~int(79, 130, 0, 1);call write~init~int(78, 130, 1, 1);call write~init~int(0, 130, 2, 1);call #Ultimate.allocInit(4, 131);call write~init~int(79, 131, 0, 1);call write~init~int(70, 131, 1, 1);call write~init~int(70, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(50, 132);call #Ultimate.allocInit(44, 133);call #Ultimate.allocInit(37, 134);call #Ultimate.allocInit(52, 135);call #Ultimate.allocInit(48, 136);call #Ultimate.allocInit(43, 137);call #Ultimate.allocInit(43, 138);call #Ultimate.allocInit(23, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(23, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(23, 143);call #Ultimate.allocInit(23, 144);call #Ultimate.allocInit(32, 145);call #Ultimate.allocInit(44, 146);call #Ultimate.allocInit(28, 147);call #Ultimate.allocInit(51, 148);call #Ultimate.allocInit(36, 149);call #Ultimate.allocInit(56, 150);call #Ultimate.allocInit(56, 151);call #Ultimate.allocInit(29, 152);call #Ultimate.allocInit(66, 153);call #Ultimate.allocInit(73, 154);call #Ultimate.allocInit(37, 155);call #Ultimate.allocInit(62, 156);call #Ultimate.allocInit(33, 157);call #Ultimate.allocInit(44, 158);call #Ultimate.allocInit(26, 159);call #Ultimate.allocInit(32, 160);call #Ultimate.allocInit(44, 161);call #Ultimate.allocInit(42, 162);call #Ultimate.allocInit(42, 163);call #Ultimate.allocInit(43, 164);call #Ultimate.allocInit(51, 165);call #Ultimate.allocInit(47, 166);call #Ultimate.allocInit(46, 167);call #Ultimate.allocInit(47, 168);call #Ultimate.allocInit(51, 169);call #Ultimate.allocInit(51, 170);call #Ultimate.allocInit(47, 171);call #Ultimate.allocInit(55, 172);call #Ultimate.allocInit(33, 173);call #Ultimate.allocInit(33, 174);call #Ultimate.allocInit(70, 175);call #Ultimate.allocInit(34, 176);call #Ultimate.allocInit(73, 177);call #Ultimate.allocInit(34, 178);call #Ultimate.allocInit(71, 179);call #Ultimate.allocInit(34, 180);call #Ultimate.allocInit(46, 181);call #Ultimate.allocInit(34, 182);call #Ultimate.allocInit(44, 183);call #Ultimate.allocInit(34, 184);call #Ultimate.allocInit(30, 185);call #Ultimate.allocInit(44, 186);call #Ultimate.allocInit(34, 187);call #Ultimate.allocInit(22, 188);call #Ultimate.allocInit(4, 189);call write~init~int(89, 189, 0, 1);call write~init~int(101, 189, 1, 1);call write~init~int(115, 189, 2, 1);call write~init~int(0, 189, 3, 1);call #Ultimate.allocInit(3, 190);call write~init~int(78, 190, 0, 1);call write~init~int(111, 190, 1, 1);call write~init~int(0, 190, 2, 1);call #Ultimate.allocInit(58, 191);call #Ultimate.allocInit(34, 192);call #Ultimate.allocInit(25, 193);call #Ultimate.allocInit(48, 194);call #Ultimate.allocInit(34, 195);call #Ultimate.allocInit(31, 196);call #Ultimate.allocInit(52, 197);call #Ultimate.allocInit(34, 198);call #Ultimate.allocInit(29, 199);call #Ultimate.allocInit(47, 200);call #Ultimate.allocInit(34, 201);call #Ultimate.allocInit(24, 202);call #Ultimate.allocInit(48, 203);call #Ultimate.allocInit(34, 204);call #Ultimate.allocInit(22, 205);call #Ultimate.allocInit(49, 206);call #Ultimate.allocInit(34, 207);call #Ultimate.allocInit(12, 208);call #Ultimate.allocInit(3, 209);call write~init~int(53, 209, 0, 1);call write~init~int(71, 209, 1, 1);call write~init~int(0, 209, 2, 1);call #Ultimate.allocInit(5, 210);call write~init~int(50, 210, 0, 1);call write~init~int(46, 210, 1, 1);call write~init~int(52, 210, 2, 1);call write~init~int(71, 210, 3, 1);call write~init~int(0, 210, 4, 1);call #Ultimate.allocInit(5, 211);call write~init~int(72, 211, 0, 1);call write~init~int(84, 211, 1, 1);call write~init~int(52, 211, 2, 1);call write~init~int(48, 211, 3, 1);call write~init~int(0, 211, 4, 1);call #Ultimate.allocInit(5, 212);call write~init~int(72, 212, 0, 1);call write~init~int(84, 212, 1, 1);call write~init~int(50, 212, 2, 1);call write~init~int(48, 212, 3, 1);call write~init~int(0, 212, 4, 1);call #Ultimate.allocInit(7, 213);call write~init~int(76, 213, 0, 1);call write~init~int(101, 213, 1, 1);call write~init~int(103, 213, 2, 1);call write~init~int(97, 213, 3, 1);call write~init~int(99, 213, 4, 1);call write~init~int(121, 213, 5, 1);call write~init~int(0, 213, 6, 1);call #Ultimate.allocInit(5, 214);call write~init~int(105, 214, 0, 1);call write~init~int(100, 214, 1, 1);call write~init~int(108, 214, 2, 1);call write~init~int(101, 214, 3, 1);call write~init~int(0, 214, 4, 1);call #Ultimate.allocInit(7, 215);call write~init~int(117, 215, 0, 1);call write~init~int(112, 215, 1, 1);call write~init~int(108, 215, 2, 1);call write~init~int(105, 215, 3, 1);call write~init~int(110, 215, 4, 1);call write~init~int(107, 215, 5, 1);call write~init~int(0, 215, 6, 1);call #Ultimate.allocInit(9, 216);call #Ultimate.allocInit(54, 217);call #Ultimate.allocInit(34, 218);call #Ultimate.allocInit(17, 219);call #Ultimate.allocInit(39, 220);call #Ultimate.allocInit(34, 221);call #Ultimate.allocInit(18, 222);call #Ultimate.allocInit(11, 223);call #Ultimate.allocInit(9, 224);call #Ultimate.allocInit(75, 225);call #Ultimate.allocInit(34, 226);call #Ultimate.allocInit(42, 227);call #Ultimate.allocInit(34, 228);call #Ultimate.allocInit(18, 229);call #Ultimate.allocInit(7, 230);call write~init~int(73, 230, 0, 1);call write~init~int(80, 230, 1, 1);call write~init~int(83, 230, 2, 1);call write~init~int(32, 230, 3, 1);call write~init~int(79, 230, 4, 1);call write~init~int(78, 230, 5, 1);call write~init~int(0, 230, 6, 1);call #Ultimate.allocInit(8, 231);call #Ultimate.allocInit(7, 232);call write~init~int(76, 232, 0, 1);call write~init~int(80, 232, 1, 1);call write~init~int(83, 232, 2, 1);call write~init~int(32, 232, 3, 1);call write~init~int(79, 232, 4, 1);call write~init~int(78, 232, 5, 1);call write~init~int(0, 232, 6, 1);call #Ultimate.allocInit(8, 233);call #Ultimate.allocInit(34, 234);call #Ultimate.allocInit(34, 235);call #Ultimate.allocInit(39, 236);call #Ultimate.allocInit(48, 237);call #Ultimate.allocInit(34, 238);call #Ultimate.allocInit(24, 239);call #Ultimate.allocInit(54, 240);call #Ultimate.allocInit(34, 241);call #Ultimate.allocInit(33, 242);call #Ultimate.allocInit(34, 243);call #Ultimate.allocInit(34, 244);call #Ultimate.allocInit(39, 245);call #Ultimate.allocInit(79, 246);call #Ultimate.allocInit(34, 247);call #Ultimate.allocInit(8, 248);call #Ultimate.allocInit(44, 249);call #Ultimate.allocInit(34, 250);call #Ultimate.allocInit(21, 251);call #Ultimate.allocInit(34, 252);call #Ultimate.allocInit(34, 253);call #Ultimate.allocInit(37, 254);call #Ultimate.allocInit(41, 255);call #Ultimate.allocInit(34, 256);call #Ultimate.allocInit(19, 257);call #Ultimate.allocInit(47, 258);call #Ultimate.allocInit(34, 259);call #Ultimate.allocInit(19, 260);call #Ultimate.allocInit(53, 261);call #Ultimate.allocInit(34, 262);call #Ultimate.allocInit(23, 263);call #Ultimate.allocInit(53, 264);call #Ultimate.allocInit(34, 265);call #Ultimate.allocInit(34, 266);call #Ultimate.allocInit(59, 267);call #Ultimate.allocInit(34, 268);call #Ultimate.allocInit(34, 269);call #Ultimate.allocInit(47, 270);call #Ultimate.allocInit(34, 271);call #Ultimate.allocInit(22, 272);call #Ultimate.allocInit(47, 273);call #Ultimate.allocInit(34, 274);call #Ultimate.allocInit(28, 275);call #Ultimate.allocInit(53, 276);call #Ultimate.allocInit(34, 277);call #Ultimate.allocInit(24, 278);call #Ultimate.allocInit(59, 279);call #Ultimate.allocInit(34, 280);call #Ultimate.allocInit(35, 281);call #Ultimate.allocInit(43, 282);call #Ultimate.allocInit(34, 283);call #Ultimate.allocInit(22, 284);call #Ultimate.allocInit(43, 285);call #Ultimate.allocInit(34, 286);call #Ultimate.allocInit(21, 287);call #Ultimate.allocInit(28, 288);call #Ultimate.allocInit(28, 289);call #Ultimate.allocInit(29, 290);call #Ultimate.allocInit(30, 291);call #Ultimate.allocInit(29, 292);call #Ultimate.allocInit(30, 293);call #Ultimate.allocInit(32, 294);call #Ultimate.allocInit(33, 295);call #Ultimate.allocInit(32, 296);call #Ultimate.allocInit(35, 297);call #Ultimate.allocInit(30, 298);call #Ultimate.allocInit(30, 299);call #Ultimate.allocInit(45, 300);call #Ultimate.allocInit(9, 301);call #Ultimate.allocInit(9, 302);call #Ultimate.allocInit(54, 303);call #Ultimate.allocInit(61, 304);call #Ultimate.allocInit(70, 305);call #Ultimate.allocInit(52, 306);call #Ultimate.allocInit(48, 307);call #Ultimate.allocInit(42, 308);call #Ultimate.allocInit(42, 309);call #Ultimate.allocInit(51, 310);call #Ultimate.allocInit(23, 311);call #Ultimate.allocInit(75, 312);call #Ultimate.allocInit(76, 313);call #Ultimate.allocInit(54, 314);call #Ultimate.allocInit(43, 315);call #Ultimate.allocInit(4, 316);call write~init~int(89, 316, 0, 1);call write~init~int(101, 316, 1, 1);call write~init~int(115, 316, 2, 1);call write~init~int(0, 316, 3, 1);call #Ultimate.allocInit(3, 317);call write~init~int(78, 317, 0, 1);call write~init~int(111, 317, 1, 1);call write~init~int(0, 317, 2, 1);call #Ultimate.allocInit(61, 318);call #Ultimate.allocInit(76, 319);call #Ultimate.allocInit(40, 320);call #Ultimate.allocInit(63, 321);call #Ultimate.allocInit(63, 322);call #Ultimate.allocInit(43, 323);call #Ultimate.allocInit(22, 324);call #Ultimate.allocInit(22, 325);call #Ultimate.allocInit(45, 326);call #Ultimate.allocInit(22, 327);call #Ultimate.allocInit(22, 328);call #Ultimate.allocInit(44, 329);call #Ultimate.allocInit(22, 330);call #Ultimate.allocInit(22, 331);~LDV_IN_INTERRUPT~0 := 1;~#glcoex_dm_8723b_2ant~0.base, ~#glcoex_dm_8723b_2ant~0.offset := 332, 0;call #Ultimate.allocInit(78, 332);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#glcoex_dm_8723b_2ant~0.base);~coex_dm~0.base, ~coex_dm~0.offset := ~#glcoex_dm_8723b_2ant~0.base, ~#glcoex_dm_8723b_2ant~0.offset;~#glcoex_sta_8723b_2ant~0.base, ~#glcoex_sta_8723b_2ant~0.offset := 333, 0;call #Ultimate.allocInit(75, 333);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#glcoex_sta_8723b_2ant~0.base);~coex_sta~0.base, ~coex_sta~0.offset := ~#glcoex_sta_8723b_2ant~0.base, ~#glcoex_sta_8723b_2ant~0.offset;~#glbt_info_src_8723b_2ant~0.base, ~#glbt_info_src_8723b_2ant~0.offset := 334, 0;call #Ultimate.allocInit(24, 334);call write~init~$Pointer$(3, 0, ~#glbt_info_src_8723b_2ant~0.base, ~#glbt_info_src_8723b_2ant~0.offset, 8);call write~init~$Pointer$(4, 0, ~#glbt_info_src_8723b_2ant~0.base, 8 + ~#glbt_info_src_8723b_2ant~0.offset, 8);call write~init~$Pointer$(5, 0, ~#glbt_info_src_8723b_2ant~0.base, 16 + ~#glbt_info_src_8723b_2ant~0.offset, 8);~glcoex_ver_date_8723b_2ant~0 := 20131113;~glcoex_ver_8723b_2ant~0 := 63;~#btc_dbg_type~0.base, ~#btc_dbg_type~0.offset := 335, 0;call #Ultimate.allocInit(8, 335);call write~init~int(0, ~#btc_dbg_type~0.base, ~#btc_dbg_type~0.offset, 4);call write~init~int(0, ~#btc_dbg_type~0.base, 4 + ~#btc_dbg_type~0.offset, 4);~#gl_bt_coexist~0.base, ~#gl_bt_coexist~0.offset := 336, 0;call #Ultimate.allocInit(255, 336);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#gl_bt_coexist~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#gl_bt_coexist~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#gl_bt_coexist~0.base);~ldv_state_variable_1~0 := 0;~rtl_btc_operation_group0~0.base, ~rtl_btc_operation_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~#rtl_btc_operation~0.base, ~#rtl_btc_operation~0.offset := 337, 0;call #Ultimate.allocInit(120, 337);call write~init~$Pointer$(#funAddr~rtl_btc_init_variables.base, #funAddr~rtl_btc_init_variables.offset, ~#rtl_btc_operation~0.base, ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_init_hal_vars.base, #funAddr~rtl_btc_init_hal_vars.offset, ~#rtl_btc_operation~0.base, 8 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_init_hw_config.base, #funAddr~rtl_btc_init_hw_config.offset, ~#rtl_btc_operation~0.base, 16 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_ips_notify.base, #funAddr~rtl_btc_ips_notify.offset, ~#rtl_btc_operation~0.base, 24 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_lps_notify.base, #funAddr~rtl_btc_lps_notify.offset, ~#rtl_btc_operation~0.base, 32 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_scan_notify.base, #funAddr~rtl_btc_scan_notify.offset, ~#rtl_btc_operation~0.base, 40 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_connect_notify.base, #funAddr~rtl_btc_connect_notify.offset, ~#rtl_btc_operation~0.base, 48 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_mediastatus_notify.base, #funAddr~rtl_btc_mediastatus_notify.offset, ~#rtl_btc_operation~0.base, 56 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_periodical.base, #funAddr~rtl_btc_periodical.offset, ~#rtl_btc_operation~0.base, 64 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_halt_notify.base, #funAddr~rtl_btc_halt_notify.offset, ~#rtl_btc_operation~0.base, 72 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_btinfo_notify.base, #funAddr~rtl_btc_btinfo_notify.offset, ~#rtl_btc_operation~0.base, 80 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_is_limited_dig.base, #funAddr~rtl_btc_is_limited_dig.offset, ~#rtl_btc_operation~0.base, 88 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_is_disable_edca_turbo.base, #funAddr~rtl_btc_is_disable_edca_turbo.offset, ~#rtl_btc_operation~0.base, 96 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_is_bt_disabled.base, #funAddr~rtl_btc_is_bt_disabled.offset, ~#rtl_btc_operation~0.base, 104 + ~#rtl_btc_operation~0.offset, 8);call write~init~$Pointer$(#funAddr~rtl_btc_special_packet_notify.base, #funAddr~rtl_btc_special_packet_notify.offset, ~#rtl_btc_operation~0.base, 112 + ~#rtl_btc_operation~0.offset, 8);~#__kstrtab_rtl_btc_get_ops_pointer~0.base, ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset := 338, 0;call #Ultimate.allocInit(24, 338);call write~init~int(114, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 1 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(108, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 2 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 3 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(98, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 4 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 5 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(99, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 6 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 7 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(103, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 8 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(101, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 9 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 10 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 11 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(111, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 12 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(112, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 13 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(115, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 14 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(95, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 15 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(112, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 16 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(111, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 17 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(105, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 18 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(110, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 19 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(116, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 20 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(101, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 21 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(114, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 22 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);call write~init~int(0, ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, 23 + ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset, 1);~__ksymtab_rtl_btc_get_ops_pointer~0.value := #funAddr~rtl_btc_get_ops_pointer.base + #funAddr~rtl_btc_get_ops_pointer.offset;~__ksymtab_rtl_btc_get_ops_pointer~0.name.base, ~__ksymtab_rtl_btc_get_ops_pointer~0.name.offset := ~#__kstrtab_rtl_btc_get_ops_pointer~0.base, ~#__kstrtab_rtl_btc_get_ops_pointer~0.offset;~ldv_retval_0~0 := 0;~ldv_module_refcounter~0 := 1; {19002#true} is VALID [2022-02-20 22:12:38,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {19002#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2672#1.base, main_#t~ret2672#1.offset, main_#t~ret2673#1.base, main_#t~ret2673#1.offset, main_#t~ret2674#1.base, main_#t~ret2674#1.offset, main_#t~ret2675#1.base, main_#t~ret2675#1.offset, main_#t~ret2676#1.base, main_#t~ret2676#1.offset, main_#t~ret2677#1.base, main_#t~ret2677#1.offset, main_#t~ret2678#1.base, main_#t~ret2678#1.offset, main_#t~ret2679#1.base, main_#t~ret2679#1.offset, main_#t~nondet2680#1, main_#t~switch2681#1, main_#t~nondet2682#1, main_#t~switch2683#1, main_#t~mem2684#1, main_#t~mem2685#1, main_#t~mem2686#1, main_#t~mem2687#1, main_#t~ret2688#1, main_#t~ret2689#1, main_#t~mem2690#1, main_#t~ret2691#1, main_#t~mem2692#1, main_#t~mem2693#1, main_#t~nondet2694#1, main_#t~switch2695#1, main_#t~ret2696#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp~93#1.base, main_~tmp~93#1.offset, main_~tmp___0~57#1, main_~tmp___1~18#1, main_~tmp___2~15#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp~93#1.base, main_~tmp~93#1.offset;havoc main_~tmp___0~57#1;havoc main_~tmp___1~18#1;havoc main_~tmp___2~15#1; {19002#true} is VALID [2022-02-20 22:12:38,332 INFO L272 TraceCheckUtils]: 2: Hoare triple {19002#true} call main_#t~ret2672#1.base, main_#t~ret2672#1.offset := ldv_init_zalloc(1); {19054#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:12:38,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {19054#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(~size); {19002#true} is VALID [2022-02-20 22:12:38,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {19002#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, 1, ~size, ~size); {19062#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:12:38,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {19062#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19002#true} is VALID [2022-02-20 22:12:38,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,333 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19002#true} {19002#true} #8299#return; {19002#true} is VALID [2022-02-20 22:12:38,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {19002#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc13.base, #t~malloc13.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {19002#true} is VALID [2022-02-20 22:12:38,333 INFO L272 TraceCheckUtils]: 9: Hoare triple {19002#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {19002#true} is VALID [2022-02-20 22:12:38,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {19002#true} ~cond := #in~cond; {19002#true} is VALID [2022-02-20 22:12:38,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {19002#true} assume !(0 == ~cond); {19002#true} is VALID [2022-02-20 22:12:38,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,334 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {19002#true} {19002#true} #8301#return; {19002#true} is VALID [2022-02-20 22:12:38,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {19002#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {19002#true} is VALID [2022-02-20 22:12:38,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,334 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19002#true} {19002#true} #8317#return; {19002#true} is VALID [2022-02-20 22:12:38,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {19002#true} main_~tmp~93#1.base, main_~tmp~93#1.offset := main_#t~ret2672#1.base, main_#t~ret2672#1.offset;havoc main_#t~ret2672#1.base, main_#t~ret2672#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp~93#1.base, main_~tmp~93#1.offset;assume { :begin_inline_ldv_initialize } true; {19002#true} is VALID [2022-02-20 22:12:38,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {19002#true} assume { :end_inline_ldv_initialize } true; {19002#true} is VALID [2022-02-20 22:12:38,336 INFO L272 TraceCheckUtils]: 19: Hoare triple {19002#true} call main_#t~ret2673#1.base, main_#t~ret2673#1.offset := ldv_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,337 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19002#true} {19002#true} #8319#return; {19002#true} is VALID [2022-02-20 22:12:38,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {19002#true} havoc main_#t~ret2673#1.base, main_#t~ret2673#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,338 INFO L272 TraceCheckUtils]: 26: Hoare triple {19002#true} call main_#t~ret2674#1.base, main_#t~ret2674#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,338 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19002#true} {19002#true} #8321#return; {19002#true} is VALID [2022-02-20 22:12:38,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {19002#true} havoc main_#t~ret2674#1.base, main_#t~ret2674#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,339 INFO L272 TraceCheckUtils]: 33: Hoare triple {19002#true} call main_#t~ret2675#1.base, main_#t~ret2675#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 1); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,340 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19002#true} {19002#true} #8323#return; {19002#true} is VALID [2022-02-20 22:12:38,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {19002#true} havoc main_#t~ret2675#1.base, main_#t~ret2675#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,341 INFO L272 TraceCheckUtils]: 40: Hoare triple {19002#true} call main_#t~ret2676#1.base, main_#t~ret2676#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,342 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19002#true} {19002#true} #8325#return; {19002#true} is VALID [2022-02-20 22:12:38,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {19002#true} havoc main_#t~ret2676#1.base, main_#t~ret2676#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,346 INFO L272 TraceCheckUtils]: 47: Hoare triple {19002#true} call main_#t~ret2677#1.base, main_#t~ret2677#1.offset := ldv_memset(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset, 0, 1); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,347 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19002#true} {19002#true} #8327#return; {19002#true} is VALID [2022-02-20 22:12:38,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {19002#true} havoc main_#t~ret2677#1.base, main_#t~ret2677#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,348 INFO L272 TraceCheckUtils]: 54: Hoare triple {19002#true} call main_#t~ret2678#1.base, main_#t~ret2678#1.offset := ldv_memset(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 1); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,349 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19002#true} {19002#true} #8329#return; {19002#true} is VALID [2022-02-20 22:12:38,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {19002#true} havoc main_#t~ret2678#1.base, main_#t~ret2678#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,350 INFO L272 TraceCheckUtils]: 61: Hoare triple {19002#true} call main_#t~ret2679#1.base, main_#t~ret2679#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 1); {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:12:38,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {19063#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~3#1.base, ~tmp~3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr2713#1;#Ultimate.C_memset_#t~loopctr2713#1 := 0; {19002#true} is VALID [2022-02-20 22:12:38,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {19002#true} assume !(#Ultimate.C_memset_#t~loopctr2713#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {19002#true} is VALID [2022-02-20 22:12:38,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {19002#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res14#1.base, #t~memset~res14#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~3#1.base, ~tmp~3#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res14#1.base, #t~memset~res14#1.offset;#res#1.base, #res#1.offset := ~tmp~3#1.base, ~tmp~3#1.offset; {19002#true} is VALID [2022-02-20 22:12:38,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {19002#true} assume true; {19002#true} is VALID [2022-02-20 22:12:38,350 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19002#true} {19002#true} #8331#return; {19002#true} is VALID [2022-02-20 22:12:38,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {19002#true} havoc main_#t~ret2679#1.base, main_#t~ret2679#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {19053#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:12:38,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {19053#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet2680#1 && main_#t~nondet2680#1 <= 2147483647;main_~tmp___0~57#1 := main_#t~nondet2680#1;havoc main_#t~nondet2680#1;main_#t~switch2681#1 := 0 == main_~tmp___0~57#1; {19053#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:12:38,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {19053#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch2681#1;main_#t~switch2681#1 := main_#t~switch2681#1 || 1 == main_~tmp___0~57#1; {19053#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:12:38,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {19053#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch2681#1; {19053#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:12:38,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {19053#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet2694#1 && main_#t~nondet2694#1 <= 2147483647;main_~tmp___2~15#1 := main_#t~nondet2694#1;havoc main_#t~nondet2694#1;main_#t~switch2695#1 := 0 == main_~tmp___2~15#1; {19053#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:12:38,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {19053#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch2695#1; {19053#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:12:38,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {19053#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_rtl_btcoexist_module_exit } true; {19003#false} is VALID [2022-02-20 22:12:38,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {19003#false} assume { :end_inline_rtl_btcoexist_module_exit } true;~ldv_state_variable_0~0 := 2; {19003#false} is VALID [2022-02-20 22:12:38,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {19003#false} assume { :begin_inline_ldv_check_final_state } true; {19003#false} is VALID [2022-02-20 22:12:38,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {19003#false} assume 1 != ~ldv_module_refcounter~0; {19003#false} is VALID [2022-02-20 22:12:38,353 INFO L272 TraceCheckUtils]: 77: Hoare triple {19003#false} call ldv_error(); {19003#false} is VALID [2022-02-20 22:12:38,353 INFO L290 TraceCheckUtils]: 78: Hoare triple {19003#false} assume !false; {19003#false} is VALID [2022-02-20 22:12:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-02-20 22:12:38,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:12:38,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403832120] [2022-02-20 22:12:38,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403832120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:12:38,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:12:38,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:12:38,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004047816] [2022-02-20 22:12:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:12:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 79 [2022-02-20 22:12:38,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:12:38,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 22:12:38,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:12:38,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:12:38,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:12:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:12:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:12:38,419 INFO L87 Difference]: Start difference. First operand 2416 states and 3824 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)