./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.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/aws-c-common/aws_string_eq_c_str_harness.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 b64b813c3d856efe8cd859d380d09d4b682c371a0a165a5a5fe0d11dc206dad7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:13:06,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:13:06,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:13:07,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:13:07,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:13:07,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:13:07,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:13:07,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:13:07,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:13:07,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:13:07,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:13:07,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:13:07,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:13:07,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:13:07,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:13:07,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:13:07,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:13:07,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:13:07,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:13:07,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:13:07,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:13:07,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:13:07,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:13:07,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:13:07,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:13:07,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:13:07,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:13:07,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:13:07,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:13:07,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:13:07,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:13:07,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:13:07,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:13:07,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:13:07,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:13:07,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:13:07,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:13:07,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:13:07,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:13:07,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:13:07,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:13:07,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:13:07,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:13:07,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:13:07,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:13:07,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:13:07,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:13:07,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:13:07,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:13:07,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:13:07,064 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:13:07,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:13:07,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:13:07,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:13:07,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:13:07,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:13:07,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:13:07,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:13:07,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:13:07,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:13:07,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:13:07,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:13:07,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:13:07,066 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:13:07,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:13:07,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:13:07,067 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 -> b64b813c3d856efe8cd859d380d09d4b682c371a0a165a5a5fe0d11dc206dad7 [2022-02-20 21:13:07,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:13:07,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:13:07,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:13:07,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:13:07,276 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:13:07,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i [2022-02-20 21:13:07,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5c09afa/c82166ec5e164b3ca1a106ec9ffff77e/FLAGe2ce592a6 [2022-02-20 21:13:07,873 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:13:07,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i [2022-02-20 21:13:07,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5c09afa/c82166ec5e164b3ca1a106ec9ffff77e/FLAGe2ce592a6 [2022-02-20 21:13:08,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5c09afa/c82166ec5e164b3ca1a106ec9ffff77e [2022-02-20 21:13:08,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:13:08,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:13:08,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:13:08,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:13:08,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:13:08,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:13:08" (1/1) ... [2022-02-20 21:13:08,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe54d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:08, skipping insertion in model container [2022-02-20 21:13:08,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:13:08" (1/1) ... [2022-02-20 21:13:08,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:13:08,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:13:08,340 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/aws-c-common/aws_string_eq_c_str_harness.i[4493,4506] [2022-02-20 21:13:08,344 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/aws-c-common/aws_string_eq_c_str_harness.i[4553,4566] [2022-02-20 21:13:08,844 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,849 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,849 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,850 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,851 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,872 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,873 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,879 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:08,880 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:13:09,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:13:09,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:13:09,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:13:09,116 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:13:09,132 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:13:09,133 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:13:09,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:13:09,135 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:13:09,135 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:13:09,244 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:13:09,335 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,336 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:13:09,372 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:13:09,388 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/aws-c-common/aws_string_eq_c_str_harness.i[4493,4506] [2022-02-20 21:13:09,389 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/aws-c-common/aws_string_eq_c_str_harness.i[4553,4566] [2022-02-20 21:13:09,434 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,435 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,436 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,436 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,437 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,442 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,442 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,447 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,448 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:13:09,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:13:09,480 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:13:09,485 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:13:09,486 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:13:09,486 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:13:09,486 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:13:09,488 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:13:09,489 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:13:09,489 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:13:09,506 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:13:09,562 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,563 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:13:09,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:13:09,700 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:13:09,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09 WrapperNode [2022-02-20 21:13:09,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:13:09,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:13:09,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:13:09,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:13:09,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,826 INFO L137 Inliner]: procedures = 681, calls = 2272, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 391 [2022-02-20 21:13:09,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:13:09,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:13:09,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:13:09,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:13:09,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:13:09,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:13:09,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:13:09,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:13:09,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (1/1) ... [2022-02-20 21:13:09,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:13:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:13:09,952 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 21:13:09,970 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 21:13:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2022-02-20 21:13:09,980 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2022-02-20 21:13:09,980 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-02-20 21:13:09,980 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-02-20 21:13:09,980 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-02-20 21:13:09,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-02-20 21:13:09,980 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-02-20 21:13:09,981 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-02-20 21:13:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:13:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:13:09,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:13:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:13:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:13:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:13:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:13:09,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:13:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-02-20 21:13:09,983 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-02-20 21:13:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:13:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:13:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:13:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-02-20 21:13:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-02-20 21:13:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-02-20 21:13:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-02-20 21:13:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:13:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:13:10,153 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:13:10,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:13:10,483 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:13:10,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:13:10,491 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 21:13:10,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:13:10 BoogieIcfgContainer [2022-02-20 21:13:10,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:13:10,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:13:10,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:13:10,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:13:10,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:13:08" (1/3) ... [2022-02-20 21:13:10,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff5ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:13:10, skipping insertion in model container [2022-02-20 21:13:10,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:09" (2/3) ... [2022-02-20 21:13:10,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff5ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:13:10, skipping insertion in model container [2022-02-20 21:13:10,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:13:10" (3/3) ... [2022-02-20 21:13:10,504 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_c_str_harness.i [2022-02-20 21:13:10,508 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:13:10,508 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:13:10,537 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:13:10,544 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 21:13:10,545 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:13:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 21:13:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:13:10,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:13:10,567 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:13:10,567 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:13:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:13:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1676862830, now seen corresponding path program 1 times [2022-02-20 21:13:10,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:13:10,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243967183] [2022-02-20 21:13:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:13:10,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:13:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:13:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:10,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} #res := #t~nondet8;havoc #t~nondet8; {110#true} is VALID [2022-02-20 21:13:10,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-02-20 21:13:10,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #195#return; {110#true} is VALID [2022-02-20 21:13:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:13:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:10,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} #res := #t~nondet8;havoc #t~nondet8; {110#true} is VALID [2022-02-20 21:13:10,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-02-20 21:13:10,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #199#return; {110#true} is VALID [2022-02-20 21:13:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:13:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} ~cond := #in~cond; {110#true} is VALID [2022-02-20 21:13:11,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume 0 == ~cond % 256;assume false; {111#false} is VALID [2022-02-20 21:13:11,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#false} assume true; {111#false} is VALID [2022-02-20 21:13:11,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111#false} {110#true} #211#return; {111#false} is VALID [2022-02-20 21:13:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:13:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {110#true} is VALID [2022-02-20 21:13:11,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {110#true} is VALID [2022-02-20 21:13:11,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} #t~short467 := #t~short464; {110#true} is VALID [2022-02-20 21:13:11,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {110#true} is VALID [2022-02-20 21:13:11,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {110#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {110#true} is VALID [2022-02-20 21:13:11,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} assume true; {110#true} is VALID [2022-02-20 21:13:11,040 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110#true} {111#false} #215#return; {111#false} is VALID [2022-02-20 21:13:11,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {110#true} is VALID [2022-02-20 21:13:11,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {110#true} is VALID [2022-02-20 21:13:11,046 INFO L272 TraceCheckUtils]: 2: Hoare triple {110#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {110#true} is VALID [2022-02-20 21:13:11,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} #res := #t~nondet8;havoc #t~nondet8; {110#true} is VALID [2022-02-20 21:13:11,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {110#true} assume true; {110#true} is VALID [2022-02-20 21:13:11,047 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {110#true} {110#true} #195#return; {110#true} is VALID [2022-02-20 21:13:11,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#true} assume !(0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256);aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := 0, 0; {110#true} is VALID [2022-02-20 21:13:11,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#true} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {110#true} is VALID [2022-02-20 21:13:11,048 INFO L272 TraceCheckUtils]: 8: Hoare triple {110#true} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {110#true} is VALID [2022-02-20 21:13:11,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#true} #res := #t~nondet8;havoc #t~nondet8; {110#true} is VALID [2022-02-20 21:13:11,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#true} assume true; {110#true} is VALID [2022-02-20 21:13:11,049 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {110#true} {110#true} #199#return; {110#true} is VALID [2022-02-20 21:13:11,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {110#true} assume !(0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256);aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := 0, 0; {110#true} is VALID [2022-02-20 21:13:11,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#true} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {110#true} is VALID [2022-02-20 21:13:11,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#true} assume aws_string_eq_c_str_#t~short726#1; {110#true} is VALID [2022-02-20 21:13:11,050 INFO L272 TraceCheckUtils]: 15: Hoare triple {110#true} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {110#true} is VALID [2022-02-20 21:13:11,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {110#true} ~cond := #in~cond; {110#true} is VALID [2022-02-20 21:13:11,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {110#true} assume 0 == ~cond % 256;assume false; {111#false} is VALID [2022-02-20 21:13:11,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {111#false} assume true; {111#false} is VALID [2022-02-20 21:13:11,051 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {111#false} {110#true} #211#return; {111#false} is VALID [2022-02-20 21:13:11,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {111#false} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {111#false} is VALID [2022-02-20 21:13:11,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {111#false} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0;aws_string_eq_c_str_#res#1 := 1; {111#false} is VALID [2022-02-20 21:13:11,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {111#false} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {111#false} is VALID [2022-02-20 21:13:11,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {111#false} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {111#false} is VALID [2022-02-20 21:13:11,053 INFO L272 TraceCheckUtils]: 24: Hoare triple {111#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {110#true} is VALID [2022-02-20 21:13:11,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {110#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {110#true} is VALID [2022-02-20 21:13:11,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {110#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {110#true} is VALID [2022-02-20 21:13:11,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {110#true} #t~short467 := #t~short464; {110#true} is VALID [2022-02-20 21:13:11,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {110#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {110#true} is VALID [2022-02-20 21:13:11,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {110#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {110#true} is VALID [2022-02-20 21:13:11,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {110#true} assume true; {110#true} is VALID [2022-02-20 21:13:11,057 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {110#true} {111#false} #215#return; {111#false} is VALID [2022-02-20 21:13:11,057 INFO L272 TraceCheckUtils]: 32: Hoare triple {111#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {111#false} is VALID [2022-02-20 21:13:11,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {111#false} ~cond := #in~cond; {111#false} is VALID [2022-02-20 21:13:11,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {111#false} assume 0 == ~cond % 256; {111#false} is VALID [2022-02-20 21:13:11,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-02-20 21:13:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 21:13:11,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:13:11,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243967183] [2022-02-20 21:13:11,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243967183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:13:11,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:13:11,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:13:11,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227782830] [2022-02-20 21:13:11,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:13:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-02-20 21:13:11,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:13:11,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:13:11,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:11,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:13:11,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:13:11,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:13:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:13:11,149 INFO L87 Difference]: Start difference. First operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:13:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:11,284 INFO L93 Difference]: Finished difference Result 205 states and 281 transitions. [2022-02-20 21:13:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:13:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-02-20 21:13:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:13:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:13:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2022-02-20 21:13:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:13:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2022-02-20 21:13:11,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 281 transitions. [2022-02-20 21:13:11,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:11,575 INFO L225 Difference]: With dead ends: 205 [2022-02-20 21:13:11,575 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 21:13:11,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:13:11,579 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:13:11,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:13:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 21:13:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 21:13:11,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:13:11,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:11,605 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:11,606 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:11,612 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-02-20 21:13:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-02-20 21:13:11,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:11,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:11,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:11,614 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:11,619 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-02-20 21:13:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-02-20 21:13:11,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:11,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:11,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:13:11,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:13:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2022-02-20 21:13:11,642 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 36 [2022-02-20 21:13:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:13:11,642 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2022-02-20 21:13:11,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:13:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-02-20 21:13:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:13:11,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:13:11,643 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:13:11,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:13:11,644 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:13:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:13:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash -12080912, now seen corresponding path program 1 times [2022-02-20 21:13:11,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:13:11,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416010102] [2022-02-20 21:13:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:13:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:13:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:13:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#true} #res := #t~nondet8;havoc #t~nondet8; {756#true} is VALID [2022-02-20 21:13:11,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {756#true} {756#true} #195#return; {756#true} is VALID [2022-02-20 21:13:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:13:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#true} #res := #t~nondet8;havoc #t~nondet8; {756#true} is VALID [2022-02-20 21:13:11,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {756#true} {756#true} #199#return; {756#true} is VALID [2022-02-20 21:13:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:13:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-02-20 21:13:11,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} assume !(0 == ~cond % 256); {756#true} is VALID [2022-02-20 21:13:11,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} #211#return; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:13:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:11,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {756#true} is VALID [2022-02-20 21:13:11,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {756#true} is VALID [2022-02-20 21:13:11,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} #t~short467 := #t~short464; {756#true} is VALID [2022-02-20 21:13:11,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {756#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {756#true} is VALID [2022-02-20 21:13:11,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {756#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {756#true} is VALID [2022-02-20 21:13:11,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,840 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {756#true} {757#false} #215#return; {757#false} is VALID [2022-02-20 21:13:11,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {756#true} is VALID [2022-02-20 21:13:11,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {756#true} is VALID [2022-02-20 21:13:11,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {756#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {756#true} is VALID [2022-02-20 21:13:11,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {756#true} #res := #t~nondet8;havoc #t~nondet8; {756#true} is VALID [2022-02-20 21:13:11,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,841 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {756#true} {756#true} #195#return; {756#true} is VALID [2022-02-20 21:13:11,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {756#true} assume !(0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256);aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := 0, 0; {756#true} is VALID [2022-02-20 21:13:11,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#true} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {756#true} is VALID [2022-02-20 21:13:11,841 INFO L272 TraceCheckUtils]: 8: Hoare triple {756#true} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {756#true} is VALID [2022-02-20 21:13:11,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {756#true} #res := #t~nondet8;havoc #t~nondet8; {756#true} is VALID [2022-02-20 21:13:11,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,842 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {756#true} {756#true} #199#return; {756#true} is VALID [2022-02-20 21:13:11,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {756#true} assume !(0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256);aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := 0, 0; {764#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.offset| 0))} is VALID [2022-02-20 21:13:11,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.offset| 0))} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} assume aws_string_eq_c_str_#t~short726#1; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,844 INFO L272 TraceCheckUtils]: 15: Hoare triple {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {756#true} is VALID [2022-02-20 21:13:11,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-02-20 21:13:11,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {756#true} assume !(0 == ~cond % 256); {756#true} is VALID [2022-02-20 21:13:11,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,846 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {756#true} {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} #211#return; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0;aws_string_eq_c_str_#res#1 := 1; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} is VALID [2022-02-20 21:13:11,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {765#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {757#false} is VALID [2022-02-20 21:13:11,848 INFO L272 TraceCheckUtils]: 24: Hoare triple {757#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {756#true} is VALID [2022-02-20 21:13:11,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {756#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {756#true} is VALID [2022-02-20 21:13:11,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {756#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {756#true} is VALID [2022-02-20 21:13:11,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {756#true} #t~short467 := #t~short464; {756#true} is VALID [2022-02-20 21:13:11,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {756#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {756#true} is VALID [2022-02-20 21:13:11,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {756#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {756#true} is VALID [2022-02-20 21:13:11,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {756#true} assume true; {756#true} is VALID [2022-02-20 21:13:11,849 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {756#true} {757#false} #215#return; {757#false} is VALID [2022-02-20 21:13:11,849 INFO L272 TraceCheckUtils]: 32: Hoare triple {757#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {757#false} is VALID [2022-02-20 21:13:11,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2022-02-20 21:13:11,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {757#false} assume 0 == ~cond % 256; {757#false} is VALID [2022-02-20 21:13:11,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-02-20 21:13:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 21:13:11,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:13:11,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416010102] [2022-02-20 21:13:11,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416010102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:13:11,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:13:11,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:13:11,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521971288] [2022-02-20 21:13:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:13:11,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-02-20 21:13:11,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:13:11,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 21:13:11,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:11,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:13:11,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:13:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:13:11,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:13:11,889 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 21:13:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:12,219 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2022-02-20 21:13:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:13:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-02-20 21:13:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:13:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 21:13:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-02-20 21:13:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 21:13:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-02-20 21:13:12,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-02-20 21:13:12,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:12,367 INFO L225 Difference]: With dead ends: 148 [2022-02-20 21:13:12,367 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 21:13:12,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:13:12,368 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:13:12,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:13:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 21:13:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 21:13:12,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:13:12,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:12,375 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:12,375 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:12,378 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2022-02-20 21:13:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2022-02-20 21:13:12,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:12,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:12,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:12,380 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:12,383 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2022-02-20 21:13:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2022-02-20 21:13:12,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:12,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:12,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:13:12,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:13:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2022-02-20 21:13:12,388 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 36 [2022-02-20 21:13:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:13:12,388 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2022-02-20 21:13:12,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 21:13:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2022-02-20 21:13:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 21:13:12,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:13:12,389 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:13:12,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:13:12,390 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:13:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:13:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2108660913, now seen corresponding path program 1 times [2022-02-20 21:13:12,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:13:12,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531862184] [2022-02-20 21:13:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:13:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:13:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:13:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} #res := #t~nondet8;havoc #t~nondet8; {1327#true} is VALID [2022-02-20 21:13:12,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1327#true} {1327#true} #195#return; {1327#true} is VALID [2022-02-20 21:13:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:13:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} #res := #t~nondet8;havoc #t~nondet8; {1327#true} is VALID [2022-02-20 21:13:12,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1327#true} {1327#true} #199#return; {1327#true} is VALID [2022-02-20 21:13:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 21:13:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} #res := #t~nondet13;havoc #t~nondet13; {1327#true} is VALID [2022-02-20 21:13:12,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1327#true} {1327#true} #201#return; {1327#true} is VALID [2022-02-20 21:13:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:13:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1327#true} #203#return; {1327#true} is VALID [2022-02-20 21:13:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:13:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:13:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1327#true} #189#return; {1327#true} is VALID [2022-02-20 21:13:12,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {1371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {1327#true} is VALID [2022-02-20 21:13:12,569 INFO L272 TraceCheckUtils]: 1: Hoare triple {1327#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {1327#true} is VALID [2022-02-20 21:13:12,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,569 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1327#true} {1327#true} #189#return; {1327#true} is VALID [2022-02-20 21:13:12,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {1376#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:12,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#(not (= |bounded_malloc_#res.base| 0))} assume true; {1376#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:12,571 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1376#(not (= |bounded_malloc_#res.base| 0))} {1327#true} #205#return; {1351#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_#t~ret542#1.base| 0))} is VALID [2022-02-20 21:13:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:13:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} #207#return; {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} is VALID [2022-02-20 21:13:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 21:13:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} #211#return; {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} is VALID [2022-02-20 21:13:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:13:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:12,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {1327#true} is VALID [2022-02-20 21:13:12,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {1327#true} is VALID [2022-02-20 21:13:12,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} #t~short467 := #t~short464; {1327#true} is VALID [2022-02-20 21:13:12,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {1327#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {1327#true} is VALID [2022-02-20 21:13:12,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {1327#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {1327#true} is VALID [2022-02-20 21:13:12,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,597 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1327#true} {1328#false} #215#return; {1328#false} is VALID [2022-02-20 21:13:12,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {1327#true} is VALID [2022-02-20 21:13:12,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {1327#true} is VALID [2022-02-20 21:13:12,598 INFO L272 TraceCheckUtils]: 2: Hoare triple {1327#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {1327#true} is VALID [2022-02-20 21:13:12,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {1327#true} #res := #t~nondet8;havoc #t~nondet8; {1327#true} is VALID [2022-02-20 21:13:12,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1327#true} {1327#true} #195#return; {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#true} assume !(0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256);aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := 0, 0; {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#true} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L272 TraceCheckUtils]: 8: Hoare triple {1327#true} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1327#true} #res := #t~nondet8;havoc #t~nondet8; {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,599 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1327#true} {1327#true} #199#return; {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {1327#true} assume 0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256;assume { :begin_inline_ensure_c_str_is_allocated } true;ensure_c_str_is_allocated_#in~max_size#1 := 16;havoc ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;havoc ensure_c_str_is_allocated_#t~ret541#1, ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset, ensure_c_str_is_allocated_#t~mem543#1, ensure_c_str_is_allocated_~max_size#1, ensure_c_str_is_allocated_~cap~0#1, ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset;ensure_c_str_is_allocated_~max_size#1 := ensure_c_str_is_allocated_#in~max_size#1; {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L272 TraceCheckUtils]: 13: Hoare triple {1327#true} call ensure_c_str_is_allocated_#t~ret541#1 := nondet_uint64_t(); {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {1327#true} #res := #t~nondet13;havoc #t~nondet13; {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1327#true} {1327#true} #201#return; {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1327#true} ensure_c_str_is_allocated_~cap~0#1 := ensure_c_str_is_allocated_#t~ret541#1;havoc ensure_c_str_is_allocated_#t~ret541#1; {1327#true} is VALID [2022-02-20 21:13:12,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {1327#true} call assume_abort_if_not((if 0 == (if ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 > 0 && ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 <= ensure_c_str_is_allocated_~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {1327#true} is VALID [2022-02-20 21:13:12,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,601 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1327#true} {1327#true} #203#return; {1327#true} is VALID [2022-02-20 21:13:12,602 INFO L272 TraceCheckUtils]: 23: Hoare triple {1327#true} call ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset := bounded_malloc(ensure_c_str_is_allocated_~cap~0#1); {1371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:13:12,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {1371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {1327#true} is VALID [2022-02-20 21:13:12,602 INFO L272 TraceCheckUtils]: 25: Hoare triple {1327#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {1327#true} is VALID [2022-02-20 21:13:12,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,603 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1327#true} {1327#true} #189#return; {1327#true} is VALID [2022-02-20 21:13:12,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {1327#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {1376#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:12,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {1376#(not (= |bounded_malloc_#res.base| 0))} assume true; {1376#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:12,604 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1376#(not (= |bounded_malloc_#res.base| 0))} {1327#true} #205#return; {1351#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_#t~ret542#1.base| 0))} is VALID [2022-02-20 21:13:12,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {1351#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_#t~ret542#1.base| 0))} ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset := ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;havoc ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;call ensure_c_str_is_allocated_#t~mem543#1 := read~int(ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset + (if (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 else (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} is VALID [2022-02-20 21:13:12,605 INFO L272 TraceCheckUtils]: 34: Hoare triple {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} call assume_abort_if_not((if 0 == (if 0 == ensure_c_str_is_allocated_#t~mem543#1 then 1 else 0) then 0 else 1)); {1327#true} is VALID [2022-02-20 21:13:12,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,606 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1327#true} {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} #207#return; {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} is VALID [2022-02-20 21:13:12,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {1352#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0))} havoc ensure_c_str_is_allocated_#t~mem543#1;ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset := ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset; {1357#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))} is VALID [2022-02-20 21:13:12,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {1357#(not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))} aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset := ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;assume { :end_inline_ensure_c_str_is_allocated } true;aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset; {1358#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.base| 0))} is VALID [2022-02-20 21:13:12,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {1358#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.base| 0))} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} is VALID [2022-02-20 21:13:12,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} assume aws_string_eq_c_str_#t~short726#1; {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} is VALID [2022-02-20 21:13:12,608 INFO L272 TraceCheckUtils]: 43: Hoare triple {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {1327#true} is VALID [2022-02-20 21:13:12,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 21:13:12,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {1327#true} assume !(0 == ~cond % 256); {1327#true} is VALID [2022-02-20 21:13:12,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,608 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {1327#true} {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} #211#return; {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} is VALID [2022-02-20 21:13:12,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} is VALID [2022-02-20 21:13:12,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {1359#(not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0))} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0;aws_string_eq_c_str_#res#1 := 1; {1328#false} is VALID [2022-02-20 21:13:12,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {1328#false} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {1328#false} is VALID [2022-02-20 21:13:12,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {1328#false} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {1328#false} is VALID [2022-02-20 21:13:12,609 INFO L272 TraceCheckUtils]: 52: Hoare triple {1328#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {1327#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {1327#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {1327#true} #t~short467 := #t~short464; {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {1327#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {1327#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L290 TraceCheckUtils]: 58: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 21:13:12,610 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {1327#true} {1328#false} #215#return; {1328#false} is VALID [2022-02-20 21:13:12,611 INFO L272 TraceCheckUtils]: 60: Hoare triple {1328#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {1328#false} is VALID [2022-02-20 21:13:12,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {1328#false} ~cond := #in~cond; {1328#false} is VALID [2022-02-20 21:13:12,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {1328#false} assume 0 == ~cond % 256; {1328#false} is VALID [2022-02-20 21:13:12,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-02-20 21:13:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 21:13:12,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:13:12,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531862184] [2022-02-20 21:13:12,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531862184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:13:12,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:13:12,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 21:13:12,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737697080] [2022-02-20 21:13:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:13:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 64 [2022-02-20 21:13:12,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:13:12,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:13:12,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:12,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 21:13:12,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:13:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 21:13:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:13:12,655 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:13:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:13,833 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2022-02-20 21:13:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:13:13,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 64 [2022-02-20 21:13:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:13:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:13:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2022-02-20 21:13:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:13:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2022-02-20 21:13:13,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 169 transitions. [2022-02-20 21:13:13,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:13,975 INFO L225 Difference]: With dead ends: 138 [2022-02-20 21:13:13,975 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 21:13:13,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:13:13,977 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 89 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:13:13,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 462 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:13:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 21:13:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 21:13:13,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:13:13,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:13,984 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:13,985 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:13,988 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2022-02-20 21:13:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-02-20 21:13:13,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:13,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:13,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:13,990 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:13,993 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2022-02-20 21:13:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-02-20 21:13:13,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:13,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:13,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:13:13,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:13:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-02-20 21:13:13,997 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 64 [2022-02-20 21:13:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:13:13,998 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-02-20 21:13:13,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:13:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-02-20 21:13:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 21:13:13,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:13:13,999 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:13:14,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:13:14,000 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:13:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:13:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash -63104247, now seen corresponding path program 1 times [2022-02-20 21:13:14,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:13:14,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013156585] [2022-02-20 21:13:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:13:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:13:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:13:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} #res := #t~nondet8;havoc #t~nondet8; {1920#true} is VALID [2022-02-20 21:13:14,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1920#true} {1920#true} #195#return; {1920#true} is VALID [2022-02-20 21:13:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:13:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} #res := #t~nondet8;havoc #t~nondet8; {1920#true} is VALID [2022-02-20 21:13:14,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #199#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 21:13:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} #res := #t~nondet13;havoc #t~nondet13; {1920#true} is VALID [2022-02-20 21:13:14,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #201#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:13:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #203#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:13:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:13:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1920#true} #189#return; {1920#true} is VALID [2022-02-20 21:13:14,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {1961#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {1920#true} is VALID [2022-02-20 21:13:14,126 INFO L272 TraceCheckUtils]: 1: Hoare triple {1920#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {1920#true} is VALID [2022-02-20 21:13:14,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,127 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1920#true} {1920#true} #189#return; {1920#true} is VALID [2022-02-20 21:13:14,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {1920#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {1920#true} is VALID [2022-02-20 21:13:14,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,128 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #205#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:13:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #207#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 21:13:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #211#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:13:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:14,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {1920#true} is VALID [2022-02-20 21:13:14,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {1920#true} is VALID [2022-02-20 21:13:14,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} #t~short467 := #t~short464; {1920#true} is VALID [2022-02-20 21:13:14,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {1920#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {1920#true} is VALID [2022-02-20 21:13:14,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {1920#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {1920#true} is VALID [2022-02-20 21:13:14,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,155 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1920#true} {1921#false} #215#return; {1921#false} is VALID [2022-02-20 21:13:14,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {1920#true} is VALID [2022-02-20 21:13:14,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {1920#true} is VALID [2022-02-20 21:13:14,156 INFO L272 TraceCheckUtils]: 2: Hoare triple {1920#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {1920#true} is VALID [2022-02-20 21:13:14,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {1920#true} #res := #t~nondet8;havoc #t~nondet8; {1920#true} is VALID [2022-02-20 21:13:14,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,156 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1920#true} {1920#true} #195#return; {1920#true} is VALID [2022-02-20 21:13:14,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {1920#true} assume !(0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256);aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := 0, 0; {1925#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} is VALID [2022-02-20 21:13:14,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,161 INFO L272 TraceCheckUtils]: 8: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {1920#true} is VALID [2022-02-20 21:13:14,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {1920#true} #res := #t~nondet8;havoc #t~nondet8; {1920#true} is VALID [2022-02-20 21:13:14,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,162 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #199#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume 0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256;assume { :begin_inline_ensure_c_str_is_allocated } true;ensure_c_str_is_allocated_#in~max_size#1 := 16;havoc ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;havoc ensure_c_str_is_allocated_#t~ret541#1, ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset, ensure_c_str_is_allocated_#t~mem543#1, ensure_c_str_is_allocated_~max_size#1, ensure_c_str_is_allocated_~cap~0#1, ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset;ensure_c_str_is_allocated_~max_size#1 := ensure_c_str_is_allocated_#in~max_size#1; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,162 INFO L272 TraceCheckUtils]: 13: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret541#1 := nondet_uint64_t(); {1920#true} is VALID [2022-02-20 21:13:14,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {1920#true} #res := #t~nondet13;havoc #t~nondet13; {1920#true} is VALID [2022-02-20 21:13:14,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,163 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #201#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~cap~0#1 := ensure_c_str_is_allocated_#t~ret541#1;havoc ensure_c_str_is_allocated_#t~ret541#1; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,163 INFO L272 TraceCheckUtils]: 18: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 > 0 && ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 <= ensure_c_str_is_allocated_~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {1920#true} is VALID [2022-02-20 21:13:14,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,164 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #203#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,165 INFO L272 TraceCheckUtils]: 23: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset := bounded_malloc(ensure_c_str_is_allocated_~cap~0#1); {1961#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:13:14,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {1961#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {1920#true} is VALID [2022-02-20 21:13:14,165 INFO L272 TraceCheckUtils]: 25: Hoare triple {1920#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {1920#true} is VALID [2022-02-20 21:13:14,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,166 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1920#true} {1920#true} #189#return; {1920#true} is VALID [2022-02-20 21:13:14,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {1920#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {1920#true} is VALID [2022-02-20 21:13:14,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,167 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #205#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset := ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;havoc ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;call ensure_c_str_is_allocated_#t~mem543#1 := read~int(ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset + (if (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 else (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,168 INFO L272 TraceCheckUtils]: 34: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if 0 == ensure_c_str_is_allocated_#t~mem543#1 then 1 else 0) then 0 else 1)); {1920#true} is VALID [2022-02-20 21:13:14,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,168 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #207#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} havoc ensure_c_str_is_allocated_#t~mem543#1;ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset := ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset := ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;assume { :end_inline_ensure_c_str_is_allocated } true;aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume aws_string_eq_c_str_#t~short726#1; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,170 INFO L272 TraceCheckUtils]: 43: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {1920#true} is VALID [2022-02-20 21:13:14,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-02-20 21:13:14,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {1920#true} assume !(0 == ~cond % 256); {1920#true} is VALID [2022-02-20 21:13:14,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,171 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {1920#true} {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #211#return; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume !((aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0); {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) || (aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0);aws_string_eq_c_str_#res#1 := 0; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:14,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {1926#(and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {1921#false} is VALID [2022-02-20 21:13:14,174 INFO L272 TraceCheckUtils]: 53: Hoare triple {1921#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {1920#true} is VALID [2022-02-20 21:13:14,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {1920#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {1920#true} is VALID [2022-02-20 21:13:14,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {1920#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {1920#true} is VALID [2022-02-20 21:13:14,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {1920#true} #t~short467 := #t~short464; {1920#true} is VALID [2022-02-20 21:13:14,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {1920#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {1920#true} is VALID [2022-02-20 21:13:14,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {1920#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {1920#true} is VALID [2022-02-20 21:13:14,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-02-20 21:13:14,175 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {1920#true} {1921#false} #215#return; {1921#false} is VALID [2022-02-20 21:13:14,175 INFO L272 TraceCheckUtils]: 61: Hoare triple {1921#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {1921#false} is VALID [2022-02-20 21:13:14,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {1921#false} ~cond := #in~cond; {1921#false} is VALID [2022-02-20 21:13:14,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {1921#false} assume 0 == ~cond % 256; {1921#false} is VALID [2022-02-20 21:13:14,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {1921#false} assume !false; {1921#false} is VALID [2022-02-20 21:13:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 21:13:14,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:13:14,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013156585] [2022-02-20 21:13:14,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013156585] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:13:14,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:13:14,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:13:14,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102393407] [2022-02-20 21:13:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:13:14,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2022-02-20 21:13:14,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:13:14,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:13:14,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:14,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:13:14,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:13:14,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:13:14,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:13:14,235 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:13:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:14,791 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2022-02-20 21:13:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:13:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2022-02-20 21:13:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:13:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:13:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2022-02-20 21:13:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:13:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2022-02-20 21:13:14,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 199 transitions. [2022-02-20 21:13:14,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:14,956 INFO L225 Difference]: With dead ends: 159 [2022-02-20 21:13:14,956 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 21:13:14,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:13:14,958 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:13:14,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 289 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:13:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 21:13:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 21:13:14,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:13:14,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:14,964 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:14,964 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:14,967 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-02-20 21:13:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-02-20 21:13:14,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:14,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:14,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:14,968 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 101 states. [2022-02-20 21:13:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:14,971 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-02-20 21:13:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-02-20 21:13:14,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:14,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:14,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:13:14,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:13:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 21:13:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2022-02-20 21:13:14,975 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 65 [2022-02-20 21:13:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:13:14,975 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2022-02-20 21:13:14,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:13:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-02-20 21:13:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 21:13:14,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:13:14,977 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:13:14,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:13:14,977 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:13:14,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:13:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1726009102, now seen corresponding path program 1 times [2022-02-20 21:13:14,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:13:14,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131945477] [2022-02-20 21:13:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:13:14,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:13:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:13:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2533#true} {2533#true} #195#return; {2533#true} is VALID [2022-02-20 21:13:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:13:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:13:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:15,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2533#true} {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} #179#return; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:13:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} #181#return; {2621#(or (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (<= (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))} is VALID [2022-02-20 21:13:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 21:13:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:13:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} #189#return; {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} is VALID [2022-02-20 21:13:15,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} is VALID [2022-02-20 21:13:15,498 INFO L272 TraceCheckUtils]: 1: Hoare triple {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,500 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} #189#return; {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} is VALID [2022-02-20 21:13:15,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} is VALID [2022-02-20 21:13:15,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} assume true; {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} is VALID [2022-02-20 21:13:15,502 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} #183#return; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:13:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2533#true} {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} #185#return; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {2612#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~max_size#1 := #in~max_size#1; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,510 INFO L272 TraceCheckUtils]: 1: Hoare triple {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} call #t~ret535#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:15,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:15,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,511 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2533#true} {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} #179#return; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} ~len~1#1 := #t~ret535#1;havoc #t~ret535#1; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} call assume_abort_if_not((if 0 == (if ~len~1#1 % 18446744073709551616 < ~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,514 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} #181#return; {2621#(or (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (<= (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))} is VALID [2022-02-20 21:13:15,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {2621#(or (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (<= (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))} assume { :begin_inline_ensure_string_is_allocated } true;ensure_string_is_allocated_#in~len#1 := ~len~1#1;havoc ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset, ensure_string_is_allocated_#t~ret538#1, ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset, ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset;ensure_string_is_allocated_~len#1 := ensure_string_is_allocated_#in~len#1; {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} is VALID [2022-02-20 21:13:15,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} call ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset := bounded_malloc(-1234550 + ensure_string_is_allocated_~len#1); {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:13:15,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} is VALID [2022-02-20 21:13:15,517 INFO L272 TraceCheckUtils]: 14: Hoare triple {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,519 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} #189#return; {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} is VALID [2022-02-20 21:13:15,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} is VALID [2022-02-20 21:13:15,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} assume true; {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} is VALID [2022-02-20 21:13:15,521 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} #183#return; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset := ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,521 INFO L272 TraceCheckUtils]: 23: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} call ensure_string_is_allocated_#t~ret538#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:15,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,522 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2533#true} {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} #185#return; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} assume !(0 != ensure_string_is_allocated_#t~ret538#1 % 256);ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset := 0, 0; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} call write~$Pointer$(ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset, 8);havoc ensure_string_is_allocated_#t~ret538#1;havoc ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset;havoc ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset;call write~int(ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, 8 + ensure_string_is_allocated_~str~0#1.offset, 8);call write~int(0, ensure_string_is_allocated_~str~0#1.base, 16 + ensure_string_is_allocated_~str~0#1.offset + (if ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 else ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset := ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} #t~ret536#1.base, #t~ret536#1.offset := ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;assume { :end_inline_ensure_string_is_allocated } true;#res#1.base, #res#1.offset := #t~ret536#1.base, #t~ret536#1.offset;havoc #t~ret536#1.base, #t~ret536#1.offset; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} assume true; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,543 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} {2533#true} #197#return; {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} is VALID [2022-02-20 21:13:15,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:13:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #199#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 21:13:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:15,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #201#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:13:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #203#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:13:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:13:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:15,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {2533#true} is VALID [2022-02-20 21:13:15,601 INFO L272 TraceCheckUtils]: 1: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,601 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:15,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2533#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:15,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {2650#(not (= |bounded_malloc_#res.base| 0))} assume true; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:15,602 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2650#(not (= |bounded_malloc_#res.base| 0))} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #205#return; {2592#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#t~ret542#1.base| 0)))} is VALID [2022-02-20 21:13:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 21:13:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2533#true} {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} #207#return; {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} is VALID [2022-02-20 21:13:15,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-02-20 21:13:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2533#true} {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} #211#return; {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} is VALID [2022-02-20 21:13:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 21:13:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#true} #t~short467 := #t~short464; {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {2533#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2533#true} {2534#false} #215#return; {2534#false} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {2533#true} is VALID [2022-02-20 21:13:15,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {2533#true} is VALID [2022-02-20 21:13:15,623 INFO L272 TraceCheckUtils]: 2: Hoare triple {2533#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:15,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,623 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2533#true} {2533#true} #195#return; {2533#true} is VALID [2022-02-20 21:13:15,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {2533#true} assume 0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256; {2533#true} is VALID [2022-02-20 21:13:15,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {2533#true} call aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset := ensure_string_is_allocated_bounded_length(16); {2612#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:13:15,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {2612#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~max_size#1 := #in~max_size#1; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,624 INFO L272 TraceCheckUtils]: 9: Hoare triple {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} call #t~ret535#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:15,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:15,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,624 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2533#true} {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} #179#return; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} ~len~1#1 := #t~ret535#1;havoc #t~ret535#1; {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} is VALID [2022-02-20 21:13:15,625 INFO L272 TraceCheckUtils]: 14: Hoare triple {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} call assume_abort_if_not((if 0 == (if ~len~1#1 % 18446744073709551616 < ~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,627 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2613#(or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0))} #181#return; {2621#(or (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (<= (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))} is VALID [2022-02-20 21:13:15,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {2621#(or (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (<= (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))} assume { :begin_inline_ensure_string_is_allocated } true;ensure_string_is_allocated_#in~len#1 := ~len~1#1;havoc ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset, ensure_string_is_allocated_#t~ret538#1, ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset, ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset;ensure_string_is_allocated_~len#1 := ensure_string_is_allocated_#in~len#1; {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} is VALID [2022-02-20 21:13:15,629 INFO L272 TraceCheckUtils]: 20: Hoare triple {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} call ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset := bounded_malloc(-1234550 + ensure_string_is_allocated_~len#1); {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:13:15,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} is VALID [2022-02-20 21:13:15,630 INFO L272 TraceCheckUtils]: 22: Hoare triple {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {2533#true} ~cond := #in~cond; {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:13:15,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {2636#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:13:15,632 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2637#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2639#(= |bounded_malloc_#in~size| bounded_malloc_~size)} #189#return; {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} is VALID [2022-02-20 21:13:15,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {2644#(and (= |bounded_malloc_#in~size| bounded_malloc_~size) (<= bounded_malloc_~size (+ (* (div bounded_malloc_~size 18446744073709551616) 18446744073709551616) 36028797018963967)))} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} is VALID [2022-02-20 21:13:15,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} assume true; {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} is VALID [2022-02-20 21:13:15,634 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2645#(<= |bounded_malloc_#in~size| (+ 36028797018963967 (* 18446744073709551616 (div |bounded_malloc_#in~size| 18446744073709551616))))} {2622#(or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))} #183#return; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset := ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,634 INFO L272 TraceCheckUtils]: 31: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} call ensure_string_is_allocated_#t~ret538#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:15,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,635 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2533#true} {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} #185#return; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} assume !(0 != ensure_string_is_allocated_#t~ret538#1 % 256);ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset := 0, 0; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} call write~$Pointer$(ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset, 8);havoc ensure_string_is_allocated_#t~ret538#1;havoc ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset;havoc ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset;call write~int(ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, 8 + ensure_string_is_allocated_~str~0#1.offset, 8);call write~int(0, ensure_string_is_allocated_~str~0#1.base, 16 + ensure_string_is_allocated_~str~0#1.offset + (if ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 else ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset := ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} #t~ret536#1.base, #t~ret536#1.offset := ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;assume { :end_inline_ensure_string_is_allocated } true;#res#1.base, #res#1.offset := #t~ret536#1.base, #t~ret536#1.offset;havoc #t~ret536#1.base, #t~ret536#1.offset; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} assume true; {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} is VALID [2022-02-20 21:13:15,637 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2632#(not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))} {2533#true} #197#return; {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} is VALID [2022-02-20 21:13:15,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {2571#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} is VALID [2022-02-20 21:13:15,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {2571#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,638 INFO L272 TraceCheckUtils]: 42: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:15,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:15,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,638 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #199#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume 0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256;assume { :begin_inline_ensure_c_str_is_allocated } true;ensure_c_str_is_allocated_#in~max_size#1 := 16;havoc ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;havoc ensure_c_str_is_allocated_#t~ret541#1, ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset, ensure_c_str_is_allocated_#t~mem543#1, ensure_c_str_is_allocated_~max_size#1, ensure_c_str_is_allocated_~cap~0#1, ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset;ensure_c_str_is_allocated_~max_size#1 := ensure_c_str_is_allocated_#in~max_size#1; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,639 INFO L272 TraceCheckUtils]: 47: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret541#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:15,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:15,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,639 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #201#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~cap~0#1 := ensure_c_str_is_allocated_#t~ret541#1;havoc ensure_c_str_is_allocated_#t~ret541#1; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,640 INFO L272 TraceCheckUtils]: 52: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 > 0 && ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 <= ensure_c_str_is_allocated_~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,640 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #203#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:15,641 INFO L272 TraceCheckUtils]: 57: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset := bounded_malloc(ensure_c_str_is_allocated_~cap~0#1); {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:13:15,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {2638#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size; {2533#true} is VALID [2022-02-20 21:13:15,641 INFO L272 TraceCheckUtils]: 59: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,641 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:15,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {2533#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:15,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {2650#(not (= |bounded_malloc_#res.base| 0))} assume true; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:15,642 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2650#(not (= |bounded_malloc_#res.base| 0))} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #205#return; {2592#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#t~ret542#1.base| 0)))} is VALID [2022-02-20 21:13:15,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {2592#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#t~ret542#1.base| 0)))} ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset := ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;havoc ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;call ensure_c_str_is_allocated_#t~mem543#1 := read~int(ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset + (if (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 else (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} is VALID [2022-02-20 21:13:15,643 INFO L272 TraceCheckUtils]: 68: Hoare triple {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} call assume_abort_if_not((if 0 == (if 0 == ensure_c_str_is_allocated_#t~mem543#1 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,643 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {2533#true} {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} #207#return; {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} is VALID [2022-02-20 21:13:15,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {2593#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} havoc ensure_c_str_is_allocated_#t~mem543#1;ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset := ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset; {2598#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} is VALID [2022-02-20 21:13:15,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {2598#(and (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset := ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;assume { :end_inline_ensure_c_str_is_allocated } true;aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset; {2599#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} is VALID [2022-02-20 21:13:15,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {2599#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1306#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)))} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} is VALID [2022-02-20 21:13:15,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} assume aws_string_eq_c_str_#t~short726#1; {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} is VALID [2022-02-20 21:13:15,645 INFO L272 TraceCheckUtils]: 77: Hoare triple {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:15,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:15,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:15,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,646 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {2533#true} {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} #211#return; {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} is VALID [2022-02-20 21:13:15,646 INFO L290 TraceCheckUtils]: 82: Hoare triple {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} is VALID [2022-02-20 21:13:15,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} assume !((aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0); {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 84: Hoare triple {2600#(and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~str#1.base| 0)))} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) || (aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0);aws_string_eq_c_str_#res#1 := 0; {2534#false} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 85: Hoare triple {2534#false} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {2534#false} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 86: Hoare triple {2534#false} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {2534#false} is VALID [2022-02-20 21:13:15,647 INFO L272 TraceCheckUtils]: 87: Hoare triple {2534#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 88: Hoare triple {2533#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 89: Hoare triple {2533#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 90: Hoare triple {2533#true} #t~short467 := #t~short464; {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 91: Hoare triple {2533#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 92: Hoare triple {2533#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L290 TraceCheckUtils]: 93: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:15,647 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {2533#true} {2534#false} #215#return; {2534#false} is VALID [2022-02-20 21:13:15,648 INFO L272 TraceCheckUtils]: 95: Hoare triple {2534#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {2534#false} is VALID [2022-02-20 21:13:15,648 INFO L290 TraceCheckUtils]: 96: Hoare triple {2534#false} ~cond := #in~cond; {2534#false} is VALID [2022-02-20 21:13:15,648 INFO L290 TraceCheckUtils]: 97: Hoare triple {2534#false} assume 0 == ~cond % 256; {2534#false} is VALID [2022-02-20 21:13:15,648 INFO L290 TraceCheckUtils]: 98: Hoare triple {2534#false} assume !false; {2534#false} is VALID [2022-02-20 21:13:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-02-20 21:13:15,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:13:15,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131945477] [2022-02-20 21:13:15,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131945477] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:13:15,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963627598] [2022-02-20 21:13:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:13:15,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:13:15,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:13:15,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:13:15,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:13:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 21:13:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:13:15,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:13:16,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {2533#true} is VALID [2022-02-20 21:13:16,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {2533#true} is VALID [2022-02-20 21:13:16,182 INFO L272 TraceCheckUtils]: 2: Hoare triple {2533#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:16,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:16,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,182 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2533#true} {2533#true} #195#return; {2533#true} is VALID [2022-02-20 21:13:16,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {2533#true} assume 0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L272 TraceCheckUtils]: 7: Hoare triple {2533#true} call aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset := ensure_string_is_allocated_bounded_length(16); {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {2533#true} ~max_size#1 := #in~max_size#1; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L272 TraceCheckUtils]: 9: Hoare triple {2533#true} call #t~ret535#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2533#true} {2533#true} #179#return; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {2533#true} ~len~1#1 := #t~ret535#1;havoc #t~ret535#1; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L272 TraceCheckUtils]: 14: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~len~1#1 % 18446744073709551616 < ~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2533#true} {2533#true} #181#return; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {2533#true} assume { :begin_inline_ensure_string_is_allocated } true;ensure_string_is_allocated_#in~len#1 := ~len~1#1;havoc ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset, ensure_string_is_allocated_#t~ret538#1, ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset, ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset;ensure_string_is_allocated_~len#1 := ensure_string_is_allocated_#in~len#1; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L272 TraceCheckUtils]: 20: Hoare triple {2533#true} call ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset := bounded_malloc(-1234550 + ensure_string_is_allocated_~len#1); {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {2533#true} ~size := #in~size; {2533#true} is VALID [2022-02-20 21:13:16,183 INFO L272 TraceCheckUtils]: 22: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,184 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:16,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {2533#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:16,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {2650#(not (= |bounded_malloc_#res.base| 0))} assume true; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:16,185 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2650#(not (= |bounded_malloc_#res.base| 0))} {2533#true} #183#return; {2741#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#t~ret537#1.base| 0))} is VALID [2022-02-20 21:13:16,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {2741#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#t~ret537#1.base| 0))} ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset := ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset; {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} is VALID [2022-02-20 21:13:16,186 INFO L272 TraceCheckUtils]: 31: Hoare triple {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} call ensure_string_is_allocated_#t~ret538#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:16,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:16,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,186 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2533#true} {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} #185#return; {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} is VALID [2022-02-20 21:13:16,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} assume !(0 != ensure_string_is_allocated_#t~ret538#1 % 256);ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset := 0, 0; {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} is VALID [2022-02-20 21:13:16,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} call write~$Pointer$(ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset, 8);havoc ensure_string_is_allocated_#t~ret538#1;havoc ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset;havoc ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset;call write~int(ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, 8 + ensure_string_is_allocated_~str~0#1.offset, 8);call write~int(0, ensure_string_is_allocated_~str~0#1.base, 16 + ensure_string_is_allocated_~str~0#1.offset + (if ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 else ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset := ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset; {2764#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0))} is VALID [2022-02-20 21:13:16,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {2764#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0))} #t~ret536#1.base, #t~ret536#1.offset := ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;assume { :end_inline_ensure_string_is_allocated } true;#res#1.base, #res#1.offset := #t~ret536#1.base, #t~ret536#1.offset;havoc #t~ret536#1.base, #t~ret536#1.offset; {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} is VALID [2022-02-20 21:13:16,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} assume true; {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} is VALID [2022-02-20 21:13:16,189 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} {2533#true} #197#return; {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} is VALID [2022-02-20 21:13:16,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {2571#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} is VALID [2022-02-20 21:13:16,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {2571#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,190 INFO L272 TraceCheckUtils]: 42: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:16,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:16,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,190 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #199#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume 0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256;assume { :begin_inline_ensure_c_str_is_allocated } true;ensure_c_str_is_allocated_#in~max_size#1 := 16;havoc ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;havoc ensure_c_str_is_allocated_#t~ret541#1, ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset, ensure_c_str_is_allocated_#t~mem543#1, ensure_c_str_is_allocated_~max_size#1, ensure_c_str_is_allocated_~cap~0#1, ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset;ensure_c_str_is_allocated_~max_size#1 := ensure_c_str_is_allocated_#in~max_size#1; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,190 INFO L272 TraceCheckUtils]: 47: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret541#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:16,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:16,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,191 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #201#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~cap~0#1 := ensure_c_str_is_allocated_#t~ret541#1;havoc ensure_c_str_is_allocated_#t~ret541#1; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,191 INFO L272 TraceCheckUtils]: 52: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 > 0 && ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 <= ensure_c_str_is_allocated_~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,191 INFO L290 TraceCheckUtils]: 54: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #203#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,192 INFO L272 TraceCheckUtils]: 57: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset := bounded_malloc(ensure_c_str_is_allocated_~cap~0#1); {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {2533#true} ~size := #in~size; {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L272 TraceCheckUtils]: 59: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {2533#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2533#true} is VALID [2022-02-20 21:13:16,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,193 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #205#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset := ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;havoc ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;call ensure_c_str_is_allocated_#t~mem543#1 := read~int(ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset + (if (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 else (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,193 INFO L272 TraceCheckUtils]: 68: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if 0 == ensure_c_str_is_allocated_#t~mem543#1 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,194 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #207#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} havoc ensure_c_str_is_allocated_#t~mem543#1;ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset := ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset := ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;assume { :end_inline_ensure_c_str_is_allocated } true;aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,195 INFO L290 TraceCheckUtils]: 75: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {2883#(not |ULTIMATE.start_aws_string_eq_c_str_#t~short726#1|)} is VALID [2022-02-20 21:13:16,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {2883#(not |ULTIMATE.start_aws_string_eq_c_str_#t~short726#1|)} assume aws_string_eq_c_str_#t~short726#1; {2534#false} is VALID [2022-02-20 21:13:16,195 INFO L272 TraceCheckUtils]: 77: Hoare triple {2534#false} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {2534#false} is VALID [2022-02-20 21:13:16,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {2534#false} ~cond := #in~cond; {2534#false} is VALID [2022-02-20 21:13:16,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {2534#false} assume !(0 == ~cond % 256); {2534#false} is VALID [2022-02-20 21:13:16,195 INFO L290 TraceCheckUtils]: 80: Hoare triple {2534#false} assume true; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {2534#false} {2534#false} #211#return; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {2534#false} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 83: Hoare triple {2534#false} assume !((aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0); {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {2534#false} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) || (aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0);aws_string_eq_c_str_#res#1 := 0; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {2534#false} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {2534#false} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L272 TraceCheckUtils]: 87: Hoare triple {2534#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 88: Hoare triple {2534#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 89: Hoare triple {2534#false} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 90: Hoare triple {2534#false} #t~short467 := #t~short464; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 91: Hoare triple {2534#false} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 92: Hoare triple {2534#false} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 93: Hoare triple {2534#false} assume true; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {2534#false} {2534#false} #215#return; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L272 TraceCheckUtils]: 95: Hoare triple {2534#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {2534#false} ~cond := #in~cond; {2534#false} is VALID [2022-02-20 21:13:16,196 INFO L290 TraceCheckUtils]: 97: Hoare triple {2534#false} assume 0 == ~cond % 256; {2534#false} is VALID [2022-02-20 21:13:16,197 INFO L290 TraceCheckUtils]: 98: Hoare triple {2534#false} assume !false; {2534#false} is VALID [2022-02-20 21:13:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-20 21:13:16,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:13:16,544 INFO L290 TraceCheckUtils]: 98: Hoare triple {2534#false} assume !false; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {2534#false} assume 0 == ~cond % 256; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 96: Hoare triple {2534#false} ~cond := #in~cond; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L272 TraceCheckUtils]: 95: Hoare triple {2534#false} call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1308#1); {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {2533#true} {2534#false} #215#return; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 93: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 92: Hoare triple {2533#true} #res := (if 0 == (if #t~short467 then 1 else 0) then 0 else 1);havoc #t~mem463;havoc #t~short464;havoc #t~mem465;havoc #t~mem466;havoc #t~short467; {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 91: Hoare triple {2533#true} assume #t~short467;call #t~mem465 := read~int(~str.base, 8 + ~str.offset, 8);call #t~mem466 := read~int(~str.base, 16 + ~str.offset + (if #t~mem465 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem465 % 18446744073709551616 % 18446744073709551616 else #t~mem465 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);#t~short467 := 0 == #t~mem466 % 256; {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 90: Hoare triple {2533#true} #t~short467 := #t~short464; {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {2533#true} assume #t~short464;call #t~mem463 := read~int(~str.base, 8 + ~str.offset, 8);#t~short464 := 0 == (1 + #t~mem463) % 18446744073709551616 || ~str.base != 0 || 16 + ~str.offset != 0; {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {2533#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;#t~short464 := ~str.base != 0 || ~str.offset != 0; {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L272 TraceCheckUtils]: 87: Hoare triple {2534#false} call aws_string_eq_c_str_harness_#t~ret1308#1 := aws_string_is_valid(aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset); {2533#true} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {2534#false} assume (0 != aws_string_eq_c_str_harness_#t~ret1307#1 % 256 && (aws_string_eq_c_str_harness_~str~3#1.base != 0 || aws_string_eq_c_str_harness_~str~3#1.offset != 0)) && (aws_string_eq_c_str_harness_~c_str~0#1.base != 0 || aws_string_eq_c_str_harness_~c_str~0#1.offset != 0);havoc aws_string_eq_c_str_harness_#t~ret1307#1; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 85: Hoare triple {2534#false} aws_string_eq_c_str_harness_#t~ret1307#1 := aws_string_eq_c_str_#res#1;assume { :end_inline_aws_string_eq_c_str } true; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 84: Hoare triple {2534#false} assume (aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) || (aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0);aws_string_eq_c_str_#res#1 := 0; {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 83: Hoare triple {2534#false} assume !((aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0) && aws_string_eq_c_str_~c_str#1.base == 0 && aws_string_eq_c_str_~c_str#1.offset == 0); {2534#false} is VALID [2022-02-20 21:13:16,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {2534#false} havoc aws_string_eq_c_str_#t~ret725#1;havoc aws_string_eq_c_str_#t~short726#1; {2534#false} is VALID [2022-02-20 21:13:16,546 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {2533#true} {2534#false} #211#return; {2534#false} is VALID [2022-02-20 21:13:16,546 INFO L290 TraceCheckUtils]: 80: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,546 INFO L290 TraceCheckUtils]: 79: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,546 INFO L290 TraceCheckUtils]: 78: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,546 INFO L272 TraceCheckUtils]: 77: Hoare triple {2534#false} call assume_abort_if_not((if 0 == (if aws_string_eq_c_str_#t~short726#1 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,546 INFO L290 TraceCheckUtils]: 76: Hoare triple {2883#(not |ULTIMATE.start_aws_string_eq_c_str_#t~short726#1|)} assume aws_string_eq_c_str_#t~short726#1; {2534#false} is VALID [2022-02-20 21:13:16,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset := aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1304#1;havoc aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset;assume { :begin_inline_aws_string_eq_c_str } true;aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset, aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset := aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset;havoc aws_string_eq_c_str_#res#1;havoc aws_string_eq_c_str_#t~ret725#1, aws_string_eq_c_str_#t~short726#1, aws_string_eq_c_str_#t~mem727#1, aws_string_eq_c_str_#t~ret728#1, aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset, aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset;aws_string_eq_c_str_~str#1.base, aws_string_eq_c_str_~str#1.offset := aws_string_eq_c_str_#in~str#1.base, aws_string_eq_c_str_#in~str#1.offset;aws_string_eq_c_str_~c_str#1.base, aws_string_eq_c_str_~c_str#1.offset := aws_string_eq_c_str_#in~c_str#1.base, aws_string_eq_c_str_#in~c_str#1.offset;aws_string_eq_c_str_#t~short726#1 := aws_string_eq_c_str_~str#1.base == 0 && aws_string_eq_c_str_~str#1.offset == 0; {2883#(not |ULTIMATE.start_aws_string_eq_c_str_#t~short726#1|)} is VALID [2022-02-20 21:13:16,547 INFO L290 TraceCheckUtils]: 74: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset := ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;assume { :end_inline_ensure_c_str_is_allocated } true;aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset := aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,547 INFO L290 TraceCheckUtils]: 73: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} havoc ensure_c_str_is_allocated_#t~mem543#1;ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset := ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,548 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #207#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,548 INFO L290 TraceCheckUtils]: 71: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,548 INFO L272 TraceCheckUtils]: 68: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if 0 == ensure_c_str_is_allocated_#t~mem543#1 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset := ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;havoc ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset;call ensure_c_str_is_allocated_#t~mem543#1 := read~int(ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset + (if (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 else (ensure_c_str_is_allocated_~cap~0#1 - 1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,549 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #205#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {2533#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L272 TraceCheckUtils]: 59: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {2533#true} ~size := #in~size; {2533#true} is VALID [2022-02-20 21:13:16,549 INFO L272 TraceCheckUtils]: 57: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset := bounded_malloc(ensure_c_str_is_allocated_~cap~0#1); {2533#true} is VALID [2022-02-20 21:13:16,550 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #203#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,550 INFO L272 TraceCheckUtils]: 52: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 > 0 && ensure_c_str_is_allocated_~cap~0#1 % 18446744073709551616 <= ensure_c_str_is_allocated_~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} ensure_c_str_is_allocated_~cap~0#1 := ensure_c_str_is_allocated_#t~ret541#1;havoc ensure_c_str_is_allocated_#t~ret541#1; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,550 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #201#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:16,551 INFO L272 TraceCheckUtils]: 47: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call ensure_c_str_is_allocated_#t~ret541#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:16,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} assume 0 != aws_string_eq_c_str_harness_#t~ret1304#1 % 256;assume { :begin_inline_ensure_c_str_is_allocated } true;ensure_c_str_is_allocated_#in~max_size#1 := 16;havoc ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;havoc ensure_c_str_is_allocated_#t~ret541#1, ensure_c_str_is_allocated_#t~ret542#1.base, ensure_c_str_is_allocated_#t~ret542#1.offset, ensure_c_str_is_allocated_#t~mem543#1, ensure_c_str_is_allocated_~max_size#1, ensure_c_str_is_allocated_~cap~0#1, ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset;ensure_c_str_is_allocated_~max_size#1 := ensure_c_str_is_allocated_#in~max_size#1; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,551 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2533#true} {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} #199#return; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:16,552 INFO L272 TraceCheckUtils]: 42: Hoare triple {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} call aws_string_eq_c_str_harness_#t~ret1304#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:16,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {2571#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset := aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1301#1;havoc aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset;havoc aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {2572#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0))} is VALID [2022-02-20 21:13:16,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset := aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset; {2571#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ite1303#1.base| 0))} is VALID [2022-02-20 21:13:16,553 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} {2533#true} #197#return; {2570#(not (= |ULTIMATE.start_aws_string_eq_c_str_harness_#t~ret1302#1.base| 0))} is VALID [2022-02-20 21:13:16,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} assume true; {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} is VALID [2022-02-20 21:13:16,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {2764#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0))} #t~ret536#1.base, #t~ret536#1.offset := ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;assume { :end_inline_ensure_string_is_allocated } true;#res#1.base, #res#1.offset := #t~ret536#1.base, #t~ret536#1.offset;havoc #t~ret536#1.base, #t~ret536#1.offset; {2768#(not (= |ensure_string_is_allocated_bounded_length_#res#1.base| 0))} is VALID [2022-02-20 21:13:16,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} call write~$Pointer$(ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset, 8);havoc ensure_string_is_allocated_#t~ret538#1;havoc ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset;havoc ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset;call write~int(ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, 8 + ensure_string_is_allocated_~str~0#1.offset, 8);call write~int(0, ensure_string_is_allocated_~str~0#1.base, 16 + ensure_string_is_allocated_~str~0#1.offset + (if ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 else ensure_string_is_allocated_~len#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset := ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset; {2764#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0))} is VALID [2022-02-20 21:13:16,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} assume !(0 != ensure_string_is_allocated_#t~ret538#1 % 256);ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset := 0, 0; {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} is VALID [2022-02-20 21:13:16,555 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2533#true} {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} #185#return; {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} is VALID [2022-02-20 21:13:16,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:16,555 INFO L272 TraceCheckUtils]: 31: Hoare triple {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} call ensure_string_is_allocated_#t~ret538#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:16,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {2741#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#t~ret537#1.base| 0))} ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset := ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset; {2745#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0))} is VALID [2022-02-20 21:13:16,556 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2650#(not (= |bounded_malloc_#res.base| 0))} {2533#true} #183#return; {2741#(not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#t~ret537#1.base| 0))} is VALID [2022-02-20 21:13:16,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {2650#(not (= |bounded_malloc_#res.base| 0))} assume true; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {2533#true} call #t~malloc550.base, #t~malloc550.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc550.base, #t~malloc550.offset;havoc #t~malloc550.base, #t~malloc550.offset; {2650#(not (= |bounded_malloc_#res.base| 0))} is VALID [2022-02-20 21:13:16,557 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2533#true} {2533#true} #189#return; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L272 TraceCheckUtils]: 22: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~size % 18446744073709551616 <= 36028797018963967 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {2533#true} ~size := #in~size; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L272 TraceCheckUtils]: 20: Hoare triple {2533#true} call ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset := bounded_malloc(-1234550 + ensure_string_is_allocated_~len#1); {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {2533#true} assume { :begin_inline_ensure_string_is_allocated } true;ensure_string_is_allocated_#in~len#1 := ~len~1#1;havoc ensure_string_is_allocated_#res#1.base, ensure_string_is_allocated_#res#1.offset;havoc ensure_string_is_allocated_#t~ret537#1.base, ensure_string_is_allocated_#t~ret537#1.offset, ensure_string_is_allocated_#t~ret538#1, ensure_string_is_allocated_#t~ite540#1.base, ensure_string_is_allocated_#t~ite540#1.offset, ensure_string_is_allocated_#t~ret539#1.base, ensure_string_is_allocated_#t~ret539#1.offset, ensure_string_is_allocated_~len#1, ensure_string_is_allocated_~str~0#1.base, ensure_string_is_allocated_~str~0#1.offset;ensure_string_is_allocated_~len#1 := ensure_string_is_allocated_#in~len#1; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2533#true} {2533#true} #181#return; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {2533#true} assume !(0 == ~cond % 256); {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#true} ~cond := #in~cond; {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L272 TraceCheckUtils]: 14: Hoare triple {2533#true} call assume_abort_if_not((if 0 == (if ~len~1#1 % 18446744073709551616 < ~max_size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2533#true} is VALID [2022-02-20 21:13:16,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2533#true} ~len~1#1 := #t~ret535#1;havoc #t~ret535#1; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2533#true} {2533#true} #179#return; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {2533#true} #res := #t~nondet13;havoc #t~nondet13; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L272 TraceCheckUtils]: 9: Hoare triple {2533#true} call #t~ret535#1 := nondet_uint64_t(); {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2533#true} ~max_size#1 := #in~max_size#1; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L272 TraceCheckUtils]: 7: Hoare triple {2533#true} call aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset := ensure_string_is_allocated_bounded_length(16); {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {2533#true} assume 0 != aws_string_eq_c_str_harness_#t~ret1301#1 % 256; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2533#true} {2533#true} #195#return; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {2533#true} assume true; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#true} #res := #t~nondet8;havoc #t~nondet8; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L272 TraceCheckUtils]: 2: Hoare triple {2533#true} call aws_string_eq_c_str_harness_#t~ret1301#1 := nondet_bool(); {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_string_eq_c_str_harness } true;havoc aws_string_eq_c_str_harness_#t~ret1301#1, aws_string_eq_c_str_harness_#t~ite1303#1.base, aws_string_eq_c_str_harness_#t~ite1303#1.offset, aws_string_eq_c_str_harness_#t~ret1302#1.base, aws_string_eq_c_str_harness_#t~ret1302#1.offset, aws_string_eq_c_str_harness_#t~ret1304#1, aws_string_eq_c_str_harness_#t~ite1306#1.base, aws_string_eq_c_str_harness_#t~ite1306#1.offset, aws_string_eq_c_str_harness_#t~ret1305#1.base, aws_string_eq_c_str_harness_#t~ret1305#1.offset, aws_string_eq_c_str_harness_#t~ret1307#1, aws_string_eq_c_str_harness_#t~ret1308#1, aws_string_eq_c_str_harness_#t~ret1309#1, aws_string_eq_c_str_harness_#t~mem1311#1, aws_string_eq_c_str_harness_#t~nondet1310#1, aws_string_eq_c_str_harness_#t~mem1312#1, aws_string_eq_c_str_harness_~str~3#1.base, aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset; {2533#true} is VALID [2022-02-20 21:13:16,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#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(30, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~#s_tolower_table~0.base, ~#s_tolower_table~0.offset := 6, 0;call #Ultimate.allocInit(256, 6);call write~init~int(0, ~#s_tolower_table~0.base, ~#s_tolower_table~0.offset, 1);call write~init~int(1, ~#s_tolower_table~0.base, 1 + ~#s_tolower_table~0.offset, 1);call write~init~int(2, ~#s_tolower_table~0.base, 2 + ~#s_tolower_table~0.offset, 1);call write~init~int(3, ~#s_tolower_table~0.base, 3 + ~#s_tolower_table~0.offset, 1);call write~init~int(4, ~#s_tolower_table~0.base, 4 + ~#s_tolower_table~0.offset, 1);call write~init~int(5, ~#s_tolower_table~0.base, 5 + ~#s_tolower_table~0.offset, 1);call write~init~int(6, ~#s_tolower_table~0.base, 6 + ~#s_tolower_table~0.offset, 1);call write~init~int(7, ~#s_tolower_table~0.base, 7 + ~#s_tolower_table~0.offset, 1);call write~init~int(8, ~#s_tolower_table~0.base, 8 + ~#s_tolower_table~0.offset, 1);call write~init~int(9, ~#s_tolower_table~0.base, 9 + ~#s_tolower_table~0.offset, 1);call write~init~int(10, ~#s_tolower_table~0.base, 10 + ~#s_tolower_table~0.offset, 1);call write~init~int(11, ~#s_tolower_table~0.base, 11 + ~#s_tolower_table~0.offset, 1);call write~init~int(12, ~#s_tolower_table~0.base, 12 + ~#s_tolower_table~0.offset, 1);call write~init~int(13, ~#s_tolower_table~0.base, 13 + ~#s_tolower_table~0.offset, 1);call write~init~int(14, ~#s_tolower_table~0.base, 14 + ~#s_tolower_table~0.offset, 1);call write~init~int(15, ~#s_tolower_table~0.base, 15 + ~#s_tolower_table~0.offset, 1);call write~init~int(16, ~#s_tolower_table~0.base, 16 + ~#s_tolower_table~0.offset, 1);call write~init~int(17, ~#s_tolower_table~0.base, 17 + ~#s_tolower_table~0.offset, 1);call write~init~int(18, ~#s_tolower_table~0.base, 18 + ~#s_tolower_table~0.offset, 1);call write~init~int(19, ~#s_tolower_table~0.base, 19 + ~#s_tolower_table~0.offset, 1);call write~init~int(20, ~#s_tolower_table~0.base, 20 + ~#s_tolower_table~0.offset, 1);call write~init~int(21, ~#s_tolower_table~0.base, 21 + ~#s_tolower_table~0.offset, 1);call write~init~int(22, ~#s_tolower_table~0.base, 22 + ~#s_tolower_table~0.offset, 1);call write~init~int(23, ~#s_tolower_table~0.base, 23 + ~#s_tolower_table~0.offset, 1);call write~init~int(24, ~#s_tolower_table~0.base, 24 + ~#s_tolower_table~0.offset, 1);call write~init~int(25, ~#s_tolower_table~0.base, 25 + ~#s_tolower_table~0.offset, 1);call write~init~int(26, ~#s_tolower_table~0.base, 26 + ~#s_tolower_table~0.offset, 1);call write~init~int(27, ~#s_tolower_table~0.base, 27 + ~#s_tolower_table~0.offset, 1);call write~init~int(28, ~#s_tolower_table~0.base, 28 + ~#s_tolower_table~0.offset, 1);call write~init~int(29, ~#s_tolower_table~0.base, 29 + ~#s_tolower_table~0.offset, 1);call write~init~int(30, ~#s_tolower_table~0.base, 30 + ~#s_tolower_table~0.offset, 1);call write~init~int(31, ~#s_tolower_table~0.base, 31 + ~#s_tolower_table~0.offset, 1);call write~init~int(32, ~#s_tolower_table~0.base, 32 + ~#s_tolower_table~0.offset, 1);call write~init~int(33, ~#s_tolower_table~0.base, 33 + ~#s_tolower_table~0.offset, 1);call write~init~int(34, ~#s_tolower_table~0.base, 34 + ~#s_tolower_table~0.offset, 1);call write~init~int(35, ~#s_tolower_table~0.base, 35 + ~#s_tolower_table~0.offset, 1);call write~init~int(36, ~#s_tolower_table~0.base, 36 + ~#s_tolower_table~0.offset, 1);call write~init~int(37, ~#s_tolower_table~0.base, 37 + ~#s_tolower_table~0.offset, 1);call write~init~int(38, ~#s_tolower_table~0.base, 38 + ~#s_tolower_table~0.offset, 1);call write~init~int(39, ~#s_tolower_table~0.base, 39 + ~#s_tolower_table~0.offset, 1);call write~init~int(40, ~#s_tolower_table~0.base, 40 + ~#s_tolower_table~0.offset, 1);call write~init~int(41, ~#s_tolower_table~0.base, 41 + ~#s_tolower_table~0.offset, 1);call write~init~int(42, ~#s_tolower_table~0.base, 42 + ~#s_tolower_table~0.offset, 1);call write~init~int(43, ~#s_tolower_table~0.base, 43 + ~#s_tolower_table~0.offset, 1);call write~init~int(44, ~#s_tolower_table~0.base, 44 + ~#s_tolower_table~0.offset, 1);call write~init~int(45, ~#s_tolower_table~0.base, 45 + ~#s_tolower_table~0.offset, 1);call write~init~int(46, ~#s_tolower_table~0.base, 46 + ~#s_tolower_table~0.offset, 1);call write~init~int(47, ~#s_tolower_table~0.base, 47 + ~#s_tolower_table~0.offset, 1);call write~init~int(48, ~#s_tolower_table~0.base, 48 + ~#s_tolower_table~0.offset, 1);call write~init~int(49, ~#s_tolower_table~0.base, 49 + ~#s_tolower_table~0.offset, 1);call write~init~int(50, ~#s_tolower_table~0.base, 50 + ~#s_tolower_table~0.offset, 1);call write~init~int(51, ~#s_tolower_table~0.base, 51 + ~#s_tolower_table~0.offset, 1);call write~init~int(52, ~#s_tolower_table~0.base, 52 + ~#s_tolower_table~0.offset, 1);call write~init~int(53, ~#s_tolower_table~0.base, 53 + ~#s_tolower_table~0.offset, 1);call write~init~int(54, ~#s_tolower_table~0.base, 54 + ~#s_tolower_table~0.offset, 1);call write~init~int(55, ~#s_tolower_table~0.base, 55 + ~#s_tolower_table~0.offset, 1);call write~init~int(56, ~#s_tolower_table~0.base, 56 + ~#s_tolower_table~0.offset, 1);call write~init~int(57, ~#s_tolower_table~0.base, 57 + ~#s_tolower_table~0.offset, 1);call write~init~int(58, ~#s_tolower_table~0.base, 58 + ~#s_tolower_table~0.offset, 1);call write~init~int(59, ~#s_tolower_table~0.base, 59 + ~#s_tolower_table~0.offset, 1);call write~init~int(60, ~#s_tolower_table~0.base, 60 + ~#s_tolower_table~0.offset, 1);call write~init~int(61, ~#s_tolower_table~0.base, 61 + ~#s_tolower_table~0.offset, 1);call write~init~int(62, ~#s_tolower_table~0.base, 62 + ~#s_tolower_table~0.offset, 1);call write~init~int(63, ~#s_tolower_table~0.base, 63 + ~#s_tolower_table~0.offset, 1);call write~init~int(64, ~#s_tolower_table~0.base, 64 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 65 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 66 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 67 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 68 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 69 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 70 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 71 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 72 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 73 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 74 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 75 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 76 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 77 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 78 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 79 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 80 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 81 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 82 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 83 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 84 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 85 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 86 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 87 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 88 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 89 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 90 + ~#s_tolower_table~0.offset, 1);call write~init~int(91, ~#s_tolower_table~0.base, 91 + ~#s_tolower_table~0.offset, 1);call write~init~int(92, ~#s_tolower_table~0.base, 92 + ~#s_tolower_table~0.offset, 1);call write~init~int(93, ~#s_tolower_table~0.base, 93 + ~#s_tolower_table~0.offset, 1);call write~init~int(94, ~#s_tolower_table~0.base, 94 + ~#s_tolower_table~0.offset, 1);call write~init~int(95, ~#s_tolower_table~0.base, 95 + ~#s_tolower_table~0.offset, 1);call write~init~int(96, ~#s_tolower_table~0.base, 96 + ~#s_tolower_table~0.offset, 1);call write~init~int(97, ~#s_tolower_table~0.base, 97 + ~#s_tolower_table~0.offset, 1);call write~init~int(98, ~#s_tolower_table~0.base, 98 + ~#s_tolower_table~0.offset, 1);call write~init~int(99, ~#s_tolower_table~0.base, 99 + ~#s_tolower_table~0.offset, 1);call write~init~int(100, ~#s_tolower_table~0.base, 100 + ~#s_tolower_table~0.offset, 1);call write~init~int(101, ~#s_tolower_table~0.base, 101 + ~#s_tolower_table~0.offset, 1);call write~init~int(102, ~#s_tolower_table~0.base, 102 + ~#s_tolower_table~0.offset, 1);call write~init~int(103, ~#s_tolower_table~0.base, 103 + ~#s_tolower_table~0.offset, 1);call write~init~int(104, ~#s_tolower_table~0.base, 104 + ~#s_tolower_table~0.offset, 1);call write~init~int(105, ~#s_tolower_table~0.base, 105 + ~#s_tolower_table~0.offset, 1);call write~init~int(106, ~#s_tolower_table~0.base, 106 + ~#s_tolower_table~0.offset, 1);call write~init~int(107, ~#s_tolower_table~0.base, 107 + ~#s_tolower_table~0.offset, 1);call write~init~int(108, ~#s_tolower_table~0.base, 108 + ~#s_tolower_table~0.offset, 1);call write~init~int(109, ~#s_tolower_table~0.base, 109 + ~#s_tolower_table~0.offset, 1);call write~init~int(110, ~#s_tolower_table~0.base, 110 + ~#s_tolower_table~0.offset, 1);call write~init~int(111, ~#s_tolower_table~0.base, 111 + ~#s_tolower_table~0.offset, 1);call write~init~int(112, ~#s_tolower_table~0.base, 112 + ~#s_tolower_table~0.offset, 1);call write~init~int(113, ~#s_tolower_table~0.base, 113 + ~#s_tolower_table~0.offset, 1);call write~init~int(114, ~#s_tolower_table~0.base, 114 + ~#s_tolower_table~0.offset, 1);call write~init~int(115, ~#s_tolower_table~0.base, 115 + ~#s_tolower_table~0.offset, 1);call write~init~int(116, ~#s_tolower_table~0.base, 116 + ~#s_tolower_table~0.offset, 1);call write~init~int(117, ~#s_tolower_table~0.base, 117 + ~#s_tolower_table~0.offset, 1);call write~init~int(118, ~#s_tolower_table~0.base, 118 + ~#s_tolower_table~0.offset, 1);call write~init~int(119, ~#s_tolower_table~0.base, 119 + ~#s_tolower_table~0.offset, 1);call write~init~int(120, ~#s_tolower_table~0.base, 120 + ~#s_tolower_table~0.offset, 1);call write~init~int(121, ~#s_tolower_table~0.base, 121 + ~#s_tolower_table~0.offset, 1);call write~init~int(122, ~#s_tolower_table~0.base, 122 + ~#s_tolower_table~0.offset, 1);call write~init~int(123, ~#s_tolower_table~0.base, 123 + ~#s_tolower_table~0.offset, 1);call write~init~int(124, ~#s_tolower_table~0.base, 124 + ~#s_tolower_table~0.offset, 1);call write~init~int(125, ~#s_tolower_table~0.base, 125 + ~#s_tolower_table~0.offset, 1);call write~init~int(126, ~#s_tolower_table~0.base, 126 + ~#s_tolower_table~0.offset, 1);call write~init~int(127, ~#s_tolower_table~0.base, 127 + ~#s_tolower_table~0.offset, 1);call write~init~int(128, ~#s_tolower_table~0.base, 128 + ~#s_tolower_table~0.offset, 1);call write~init~int(129, ~#s_tolower_table~0.base, 129 + ~#s_tolower_table~0.offset, 1);call write~init~int(130, ~#s_tolower_table~0.base, 130 + ~#s_tolower_table~0.offset, 1);call write~init~int(131, ~#s_tolower_table~0.base, 131 + ~#s_tolower_table~0.offset, 1);call write~init~int(132, ~#s_tolower_table~0.base, 132 + ~#s_tolower_table~0.offset, 1);call write~init~int(133, ~#s_tolower_table~0.base, 133 + ~#s_tolower_table~0.offset, 1);call write~init~int(134, ~#s_tolower_table~0.base, 134 + ~#s_tolower_table~0.offset, 1);call write~init~int(135, ~#s_tolower_table~0.base, 135 + ~#s_tolower_table~0.offset, 1);call write~init~int(136, ~#s_tolower_table~0.base, 136 + ~#s_tolower_table~0.offset, 1);call write~init~int(137, ~#s_tolower_table~0.base, 137 + ~#s_tolower_table~0.offset, 1);call write~init~int(138, ~#s_tolower_table~0.base, 138 + ~#s_tolower_table~0.offset, 1);call write~init~int(139, ~#s_tolower_table~0.base, 139 + ~#s_tolower_table~0.offset, 1);call write~init~int(140, ~#s_tolower_table~0.base, 140 + ~#s_tolower_table~0.offset, 1);call write~init~int(141, ~#s_tolower_table~0.base, 141 + ~#s_tolower_table~0.offset, 1);call write~init~int(142, ~#s_tolower_table~0.base, 142 + ~#s_tolower_table~0.offset, 1);call write~init~int(143, ~#s_tolower_table~0.base, 143 + ~#s_tolower_table~0.offset, 1);call write~init~int(144, ~#s_tolower_table~0.base, 144 + ~#s_tolower_table~0.offset, 1);call write~init~int(145, ~#s_tolower_table~0.base, 145 + ~#s_tolower_table~0.offset, 1);call write~init~int(146, ~#s_tolower_table~0.base, 146 + ~#s_tolower_table~0.offset, 1);call write~init~int(147, ~#s_tolower_table~0.base, 147 + ~#s_tolower_table~0.offset, 1);call write~init~int(148, ~#s_tolower_table~0.base, 148 + ~#s_tolower_table~0.offset, 1);call write~init~int(149, ~#s_tolower_table~0.base, 149 + ~#s_tolower_table~0.offset, 1);call write~init~int(150, ~#s_tolower_table~0.base, 150 + ~#s_tolower_table~0.offset, 1);call write~init~int(151, ~#s_tolower_table~0.base, 151 + ~#s_tolower_table~0.offset, 1);call write~init~int(152, ~#s_tolower_table~0.base, 152 + ~#s_tolower_table~0.offset, 1);call write~init~int(153, ~#s_tolower_table~0.base, 153 + ~#s_tolower_table~0.offset, 1);call write~init~int(154, ~#s_tolower_table~0.base, 154 + ~#s_tolower_table~0.offset, 1);call write~init~int(155, ~#s_tolower_table~0.base, 155 + ~#s_tolower_table~0.offset, 1);call write~init~int(156, ~#s_tolower_table~0.base, 156 + ~#s_tolower_table~0.offset, 1);call write~init~int(157, ~#s_tolower_table~0.base, 157 + ~#s_tolower_table~0.offset, 1);call write~init~int(158, ~#s_tolower_table~0.base, 158 + ~#s_tolower_table~0.offset, 1);call write~init~int(159, ~#s_tolower_table~0.base, 159 + ~#s_tolower_table~0.offset, 1);call write~init~int(160, ~#s_tolower_table~0.base, 160 + ~#s_tolower_table~0.offset, 1);call write~init~int(161, ~#s_tolower_table~0.base, 161 + ~#s_tolower_table~0.offset, 1);call write~init~int(162, ~#s_tolower_table~0.base, 162 + ~#s_tolower_table~0.offset, 1);call write~init~int(163, ~#s_tolower_table~0.base, 163 + ~#s_tolower_table~0.offset, 1);call write~init~int(164, ~#s_tolower_table~0.base, 164 + ~#s_tolower_table~0.offset, 1);call write~init~int(165, ~#s_tolower_table~0.base, 165 + ~#s_tolower_table~0.offset, 1);call write~init~int(166, ~#s_tolower_table~0.base, 166 + ~#s_tolower_table~0.offset, 1);call write~init~int(167, ~#s_tolower_table~0.base, 167 + ~#s_tolower_table~0.offset, 1);call write~init~int(168, ~#s_tolower_table~0.base, 168 + ~#s_tolower_table~0.offset, 1);call write~init~int(169, ~#s_tolower_table~0.base, 169 + ~#s_tolower_table~0.offset, 1);call write~init~int(170, ~#s_tolower_table~0.base, 170 + ~#s_tolower_table~0.offset, 1);call write~init~int(171, ~#s_tolower_table~0.base, 171 + ~#s_tolower_table~0.offset, 1);call write~init~int(172, ~#s_tolower_table~0.base, 172 + ~#s_tolower_table~0.offset, 1);call write~init~int(173, ~#s_tolower_table~0.base, 173 + ~#s_tolower_table~0.offset, 1);call write~init~int(174, ~#s_tolower_table~0.base, 174 + ~#s_tolower_table~0.offset, 1);call write~init~int(175, ~#s_tolower_table~0.base, 175 + ~#s_tolower_table~0.offset, 1);call write~init~int(176, ~#s_tolower_table~0.base, 176 + ~#s_tolower_table~0.offset, 1);call write~init~int(177, ~#s_tolower_table~0.base, 177 + ~#s_tolower_table~0.offset, 1);call write~init~int(178, ~#s_tolower_table~0.base, 178 + ~#s_tolower_table~0.offset, 1);call write~init~int(179, ~#s_tolower_table~0.base, 179 + ~#s_tolower_table~0.offset, 1);call write~init~int(180, ~#s_tolower_table~0.base, 180 + ~#s_tolower_table~0.offset, 1);call write~init~int(181, ~#s_tolower_table~0.base, 181 + ~#s_tolower_table~0.offset, 1);call write~init~int(182, ~#s_tolower_table~0.base, 182 + ~#s_tolower_table~0.offset, 1);call write~init~int(183, ~#s_tolower_table~0.base, 183 + ~#s_tolower_table~0.offset, 1);call write~init~int(184, ~#s_tolower_table~0.base, 184 + ~#s_tolower_table~0.offset, 1);call write~init~int(185, ~#s_tolower_table~0.base, 185 + ~#s_tolower_table~0.offset, 1);call write~init~int(186, ~#s_tolower_table~0.base, 186 + ~#s_tolower_table~0.offset, 1);call write~init~int(187, ~#s_tolower_table~0.base, 187 + ~#s_tolower_table~0.offset, 1);call write~init~int(188, ~#s_tolower_table~0.base, 188 + ~#s_tolower_table~0.offset, 1);call write~init~int(189, ~#s_tolower_table~0.base, 189 + ~#s_tolower_table~0.offset, 1);call write~init~int(190, ~#s_tolower_table~0.base, 190 + ~#s_tolower_table~0.offset, 1);call write~init~int(191, ~#s_tolower_table~0.base, 191 + ~#s_tolower_table~0.offset, 1);call write~init~int(192, ~#s_tolower_table~0.base, 192 + ~#s_tolower_table~0.offset, 1);call write~init~int(193, ~#s_tolower_table~0.base, 193 + ~#s_tolower_table~0.offset, 1);call write~init~int(194, ~#s_tolower_table~0.base, 194 + ~#s_tolower_table~0.offset, 1);call write~init~int(195, ~#s_tolower_table~0.base, 195 + ~#s_tolower_table~0.offset, 1);call write~init~int(196, ~#s_tolower_table~0.base, 196 + ~#s_tolower_table~0.offset, 1);call write~init~int(197, ~#s_tolower_table~0.base, 197 + ~#s_tolower_table~0.offset, 1);call write~init~int(198, ~#s_tolower_table~0.base, 198 + ~#s_tolower_table~0.offset, 1);call write~init~int(199, ~#s_tolower_table~0.base, 199 + ~#s_tolower_table~0.offset, 1);call write~init~int(200, ~#s_tolower_table~0.base, 200 + ~#s_tolower_table~0.offset, 1);call write~init~int(201, ~#s_tolower_table~0.base, 201 + ~#s_tolower_table~0.offset, 1);call write~init~int(202, ~#s_tolower_table~0.base, 202 + ~#s_tolower_table~0.offset, 1);call write~init~int(203, ~#s_tolower_table~0.base, 203 + ~#s_tolower_table~0.offset, 1);call write~init~int(204, ~#s_tolower_table~0.base, 204 + ~#s_tolower_table~0.offset, 1);call write~init~int(205, ~#s_tolower_table~0.base, 205 + ~#s_tolower_table~0.offset, 1);call write~init~int(206, ~#s_tolower_table~0.base, 206 + ~#s_tolower_table~0.offset, 1);call write~init~int(207, ~#s_tolower_table~0.base, 207 + ~#s_tolower_table~0.offset, 1);call write~init~int(208, ~#s_tolower_table~0.base, 208 + ~#s_tolower_table~0.offset, 1);call write~init~int(209, ~#s_tolower_table~0.base, 209 + ~#s_tolower_table~0.offset, 1);call write~init~int(210, ~#s_tolower_table~0.base, 210 + ~#s_tolower_table~0.offset, 1);call write~init~int(211, ~#s_tolower_table~0.base, 211 + ~#s_tolower_table~0.offset, 1);call write~init~int(212, ~#s_tolower_table~0.base, 212 + ~#s_tolower_table~0.offset, 1);call write~init~int(213, ~#s_tolower_table~0.base, 213 + ~#s_tolower_table~0.offset, 1);call write~init~int(214, ~#s_tolower_table~0.base, 214 + ~#s_tolower_table~0.offset, 1);call write~init~int(215, ~#s_tolower_table~0.base, 215 + ~#s_tolower_table~0.offset, 1);call write~init~int(216, ~#s_tolower_table~0.base, 216 + ~#s_tolower_table~0.offset, 1);call write~init~int(217, ~#s_tolower_table~0.base, 217 + ~#s_tolower_table~0.offset, 1);call write~init~int(218, ~#s_tolower_table~0.base, 218 + ~#s_tolower_table~0.offset, 1);call write~init~int(219, ~#s_tolower_table~0.base, 219 + ~#s_tolower_table~0.offset, 1);call write~init~int(220, ~#s_tolower_table~0.base, 220 + ~#s_tolower_table~0.offset, 1);call write~init~int(221, ~#s_tolower_table~0.base, 221 + ~#s_tolower_table~0.offset, 1);call write~init~int(222, ~#s_tolower_table~0.base, 222 + ~#s_tolower_table~0.offset, 1);call write~init~int(223, ~#s_tolower_table~0.base, 223 + ~#s_tolower_table~0.offset, 1);call write~init~int(224, ~#s_tolower_table~0.base, 224 + ~#s_tolower_table~0.offset, 1);call write~init~int(225, ~#s_tolower_table~0.base, 225 + ~#s_tolower_table~0.offset, 1);call write~init~int(226, ~#s_tolower_table~0.base, 226 + ~#s_tolower_table~0.offset, 1);call write~init~int(227, ~#s_tolower_table~0.base, 227 + ~#s_tolower_table~0.offset, 1);call write~init~int(228, ~#s_tolower_table~0.base, 228 + ~#s_tolower_table~0.offset, 1);call write~init~int(229, ~#s_tolower_table~0.base, 229 + ~#s_tolower_table~0.offset, 1);call write~init~int(230, ~#s_tolower_table~0.base, 230 + ~#s_tolower_table~0.offset, 1);call write~init~int(231, ~#s_tolower_table~0.base, 231 + ~#s_tolower_table~0.offset, 1);call write~init~int(232, ~#s_tolower_table~0.base, 232 + ~#s_tolower_table~0.offset, 1);call write~init~int(233, ~#s_tolower_table~0.base, 233 + ~#s_tolower_table~0.offset, 1);call write~init~int(234, ~#s_tolower_table~0.base, 234 + ~#s_tolower_table~0.offset, 1);call write~init~int(235, ~#s_tolower_table~0.base, 235 + ~#s_tolower_table~0.offset, 1);call write~init~int(236, ~#s_tolower_table~0.base, 236 + ~#s_tolower_table~0.offset, 1);call write~init~int(237, ~#s_tolower_table~0.base, 237 + ~#s_tolower_table~0.offset, 1);call write~init~int(238, ~#s_tolower_table~0.base, 238 + ~#s_tolower_table~0.offset, 1);call write~init~int(239, ~#s_tolower_table~0.base, 239 + ~#s_tolower_table~0.offset, 1);call write~init~int(240, ~#s_tolower_table~0.base, 240 + ~#s_tolower_table~0.offset, 1);call write~init~int(241, ~#s_tolower_table~0.base, 241 + ~#s_tolower_table~0.offset, 1);call write~init~int(242, ~#s_tolower_table~0.base, 242 + ~#s_tolower_table~0.offset, 1);call write~init~int(243, ~#s_tolower_table~0.base, 243 + ~#s_tolower_table~0.offset, 1);call write~init~int(244, ~#s_tolower_table~0.base, 244 + ~#s_tolower_table~0.offset, 1);call write~init~int(245, ~#s_tolower_table~0.base, 245 + ~#s_tolower_table~0.offset, 1);call write~init~int(246, ~#s_tolower_table~0.base, 246 + ~#s_tolower_table~0.offset, 1);call write~init~int(247, ~#s_tolower_table~0.base, 247 + ~#s_tolower_table~0.offset, 1);call write~init~int(248, ~#s_tolower_table~0.base, 248 + ~#s_tolower_table~0.offset, 1);call write~init~int(249, ~#s_tolower_table~0.base, 249 + ~#s_tolower_table~0.offset, 1);call write~init~int(250, ~#s_tolower_table~0.base, 250 + ~#s_tolower_table~0.offset, 1);call write~init~int(251, ~#s_tolower_table~0.base, 251 + ~#s_tolower_table~0.offset, 1);call write~init~int(252, ~#s_tolower_table~0.base, 252 + ~#s_tolower_table~0.offset, 1);call write~init~int(253, ~#s_tolower_table~0.base, 253 + ~#s_tolower_table~0.offset, 1);call write~init~int(254, ~#s_tolower_table~0.base, 254 + ~#s_tolower_table~0.offset, 1);call write~init~int(255, ~#s_tolower_table~0.base, 255 + ~#s_tolower_table~0.offset, 1); {2533#true} is VALID [2022-02-20 21:13:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-20 21:13:16,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963627598] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:13:16,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:13:16,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 27 [2022-02-20 21:13:16,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770598408] [2022-02-20 21:13:16,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:13:16,560 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) Word has length 99 [2022-02-20 21:13:16,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:13:16,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-02-20 21:13:16,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:16,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 21:13:16,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:13:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 21:13:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2022-02-20 21:13:16,665 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-02-20 21:13:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:18,503 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2022-02-20 21:13:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 21:13:18,504 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) Word has length 99 [2022-02-20 21:13:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:13:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-02-20 21:13:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-02-20 21:13:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-02-20 21:13:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-02-20 21:13:18,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 137 transitions. [2022-02-20 21:13:18,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:13:18,649 INFO L225 Difference]: With dead ends: 116 [2022-02-20 21:13:18,649 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 21:13:18,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 21:13:18,653 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:13:18,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 375 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 21:13:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 21:13:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 21:13:18,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:13:18,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:13:18,655 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:13:18,655 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:13:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:18,655 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:13:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:13:18,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:18,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:18,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:13:18,655 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:13:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:13:18,655 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:13:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:13:18,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:18,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:13:18,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:13:18,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:13:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:13:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 21:13:18,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2022-02-20 21:13:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:13:18,656 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 21:13:18,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-02-20 21:13:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:13:18,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:13:18,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:13:18,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 21:13:18,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:13:18,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 21:13:19,084 INFO L854 garLoopResultBuilder]: At program point L6816(lines 6807 6817) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-02-20 21:13:19,090 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6801 6805) no Hoare annotation was computed. [2022-02-20 21:13:19,090 INFO L858 garLoopResultBuilder]: For program point L6811-1(lines 6811 6812) no Hoare annotation was computed. [2022-02-20 21:13:19,090 INFO L854 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-02-20 21:13:19,091 INFO L858 garLoopResultBuilder]: For program point L6811-5(lines 6811 6812) no Hoare annotation was computed. [2022-02-20 21:13:19,091 INFO L858 garLoopResultBuilder]: For program point L6808-1(line 6808) no Hoare annotation was computed. [2022-02-20 21:13:19,091 INFO L854 garLoopResultBuilder]: At program point L6808(line 6808) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) [2022-02-20 21:13:19,091 INFO L858 garLoopResultBuilder]: For program point L6811-3(line 6811) no Hoare annotation was computed. [2022-02-20 21:13:19,091 INFO L854 garLoopResultBuilder]: At program point L6811-2(line 6811) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-02-20 21:13:19,091 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-02-20 21:13:19,092 INFO L858 garLoopResultBuilder]: For program point L6803-1(line 6803) no Hoare annotation was computed. [2022-02-20 21:13:19,092 INFO L854 garLoopResultBuilder]: At program point L6803(line 6803) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-02-20 21:13:19,092 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6801 6805) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-02-20 21:13:19,092 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-02-20 21:13:19,092 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6801 6805) no Hoare annotation was computed. [2022-02-20 21:13:19,093 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6883 6888) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-02-20 21:13:19,093 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6883 6888) no Hoare annotation was computed. [2022-02-20 21:13:19,093 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6883 6888) no Hoare annotation was computed. [2022-02-20 21:13:19,093 INFO L858 garLoopResultBuilder]: For program point L6884-1(lines 6884 6886) no Hoare annotation was computed. [2022-02-20 21:13:19,093 INFO L854 garLoopResultBuilder]: At program point L6884(lines 6884 6886) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-02-20 21:13:19,094 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-02-20 21:13:19,094 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-02-20 21:13:19,094 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-02-20 21:13:19,094 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-02-20 21:13:19,094 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-02-20 21:13:19,094 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-02-20 21:13:19,095 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-02-20 21:13:19,095 INFO L858 garLoopResultBuilder]: For program point L8097(lines 8097 8101) no Hoare annotation was computed. [2022-02-20 21:13:19,095 INFO L858 garLoopResultBuilder]: For program point L8095-4(lines 8095 8108) no Hoare annotation was computed. [2022-02-20 21:13:19,096 INFO L861 garLoopResultBuilder]: At program point L8095-3(lines 8095 8108) the Hoare annotation is: true [2022-02-20 21:13:19,096 INFO L858 garLoopResultBuilder]: For program point L8095-2(lines 8095 8108) no Hoare annotation was computed. [2022-02-20 21:13:19,096 INFO L858 garLoopResultBuilder]: For program point aws_array_eq_c_strFINAL(lines 8078 8111) no Hoare annotation was computed. [2022-02-20 21:13:19,096 INFO L858 garLoopResultBuilder]: For program point L8083(lines 8083 8085) no Hoare annotation was computed. [2022-02-20 21:13:19,096 INFO L861 garLoopResultBuilder]: At program point L8080-1(line 8080) the Hoare annotation is: true [2022-02-20 21:13:19,097 INFO L861 garLoopResultBuilder]: At program point L8080(line 8080) the Hoare annotation is: true [2022-02-20 21:13:19,097 INFO L861 garLoopResultBuilder]: At program point aws_array_eq_c_strENTRY(lines 8078 8111) the Hoare annotation is: true [2022-02-20 21:13:19,097 INFO L858 garLoopResultBuilder]: For program point L8103(lines 8103 8107) no Hoare annotation was computed. [2022-02-20 21:13:19,097 INFO L858 garLoopResultBuilder]: For program point aws_array_eq_c_strEXIT(lines 8078 8111) no Hoare annotation was computed. [2022-02-20 21:13:19,097 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6890 6892) no Hoare annotation was computed. [2022-02-20 21:13:19,097 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6890 6892) no Hoare annotation was computed. [2022-02-20 21:13:19,097 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6890 6892) the Hoare annotation is: true [2022-02-20 21:13:19,097 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6253 6258) the Hoare annotation is: true [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point L6257-2(line 6257) no Hoare annotation was computed. [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point L6257-3(line 6257) no Hoare annotation was computed. [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point L6257(line 6257) no Hoare annotation was computed. [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6253 6258) no Hoare annotation was computed. [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point L6257-5(line 6257) no Hoare annotation was computed. [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6253 6258) no Hoare annotation was computed. [2022-02-20 21:13:19,098 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-02-20 21:13:19,111 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-02-20 21:13:19,111 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-02-20 21:13:19,111 INFO L861 garLoopResultBuilder]: At program point L8925(line 8925) the Hoare annotation is: true [2022-02-20 21:13:19,111 INFO L858 garLoopResultBuilder]: For program point L7579(line 7579) no Hoare annotation was computed. [2022-02-20 21:13:19,112 INFO L858 garLoopResultBuilder]: For program point L7100(lines 7100 7113) no Hoare annotation was computed. [2022-02-20 21:13:19,112 INFO L858 garLoopResultBuilder]: For program point L7579-5(line 7579) no Hoare annotation was computed. [2022-02-20 21:13:19,112 INFO L854 garLoopResultBuilder]: At program point L7579-4(line 7579) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-02-20 21:13:19,112 INFO L858 garLoopResultBuilder]: For program point L7579-3(line 7579) no Hoare annotation was computed. [2022-02-20 21:13:19,112 INFO L854 garLoopResultBuilder]: At program point L7579-2(line 7579) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-02-20 21:13:19,112 INFO L854 garLoopResultBuilder]: At program point L8921(line 8921) the Hoare annotation is: false [2022-02-20 21:13:19,112 INFO L858 garLoopResultBuilder]: For program point L8921-1(line 8921) no Hoare annotation was computed. [2022-02-20 21:13:19,112 INFO L858 garLoopResultBuilder]: For program point L6820-1(line 6820) no Hoare annotation was computed. [2022-02-20 21:13:19,113 INFO L854 garLoopResultBuilder]: At program point L6820(line 6820) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-02-20 21:13:19,113 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:13:19,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 21:13:19,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:13:19,113 INFO L858 garLoopResultBuilder]: For program point L7580(lines 7580 7588) no Hoare annotation was computed. [2022-02-20 21:13:19,113 INFO L858 garLoopResultBuilder]: For program point L7101-1(lines 7100 7113) no Hoare annotation was computed. [2022-02-20 21:13:19,113 INFO L854 garLoopResultBuilder]: At program point L7101(line 7101) the Hoare annotation is: false [2022-02-20 21:13:19,113 INFO L858 garLoopResultBuilder]: For program point L8918(lines 8918 8923) no Hoare annotation was computed. [2022-02-20 21:13:19,115 INFO L854 garLoopResultBuilder]: At program point L6821-1(line 6821) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-02-20 21:13:19,115 INFO L854 garLoopResultBuilder]: At program point L6821(line 6821) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-02-20 21:13:19,115 INFO L858 garLoopResultBuilder]: For program point L7589(lines 7589 7597) no Hoare annotation was computed. [2022-02-20 21:13:19,116 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:13:19,116 INFO L854 garLoopResultBuilder]: At program point L6272(lines 6263 6273) the Hoare annotation is: false [2022-02-20 21:13:19,116 INFO L858 garLoopResultBuilder]: For program point L8919-2(line 8919) no Hoare annotation was computed. [2022-02-20 21:13:19,116 INFO L854 garLoopResultBuilder]: At program point L8915(line 8915) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-02-20 21:13:19,116 INFO L858 garLoopResultBuilder]: For program point L8915-1(lines 8915 8916) no Hoare annotation was computed. [2022-02-20 21:13:19,116 INFO L854 garLoopResultBuilder]: At program point L8919(line 8919) the Hoare annotation is: false [2022-02-20 21:13:19,116 INFO L854 garLoopResultBuilder]: At program point L8919-1(line 8919) the Hoare annotation is: false [2022-02-20 21:13:19,117 INFO L854 garLoopResultBuilder]: At program point L7598(line 7598) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-02-20 21:13:19,117 INFO L854 garLoopResultBuilder]: At program point L6826(line 6826) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-02-20 21:13:19,117 INFO L858 garLoopResultBuilder]: For program point L8915-3(lines 8915 8916) no Hoare annotation was computed. [2022-02-20 21:13:19,117 INFO L854 garLoopResultBuilder]: At program point L7598-2(lines 7577 7599) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-02-20 21:13:19,117 INFO L858 garLoopResultBuilder]: For program point L8911(lines 8911 8924) no Hoare annotation was computed. [2022-02-20 21:13:19,118 INFO L858 garLoopResultBuilder]: For program point L7598-1(line 7598) no Hoare annotation was computed. [2022-02-20 21:13:19,118 INFO L858 garLoopResultBuilder]: For program point L6822(line 6822) no Hoare annotation was computed. [2022-02-20 21:13:19,118 INFO L858 garLoopResultBuilder]: For program point L7111-1(line 7111) no Hoare annotation was computed. [2022-02-20 21:13:19,118 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: false [2022-02-20 21:13:19,119 INFO L858 garLoopResultBuilder]: For program point L6826-1(line 6826) no Hoare annotation was computed. [2022-02-20 21:13:19,119 INFO L858 garLoopResultBuilder]: For program point L7107-1(line 7107) no Hoare annotation was computed. [2022-02-20 21:13:19,121 INFO L854 garLoopResultBuilder]: At program point L7107(line 7107) the Hoare annotation is: false [2022-02-20 21:13:19,121 INFO L854 garLoopResultBuilder]: At program point L8920(line 8920) the Hoare annotation is: false [2022-02-20 21:13:19,122 INFO L858 garLoopResultBuilder]: For program point L8920-1(line 8920) no Hoare annotation was computed. [2022-02-20 21:13:19,122 INFO L858 garLoopResultBuilder]: For program point L8912-3(line 8912) no Hoare annotation was computed. [2022-02-20 21:13:19,122 INFO L858 garLoopResultBuilder]: For program point L8912-5(lines 8912 8913) no Hoare annotation was computed. [2022-02-20 21:13:19,122 INFO L861 garLoopResultBuilder]: At program point L8912(line 8912) the Hoare annotation is: true [2022-02-20 21:13:19,122 INFO L854 garLoopResultBuilder]: At program point L6827(lines 6819 6828) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) [2022-02-20 21:13:19,123 INFO L858 garLoopResultBuilder]: For program point L8912-1(lines 8912 8913) no Hoare annotation was computed. [2022-02-20 21:13:19,123 INFO L861 garLoopResultBuilder]: At program point L8912-2(line 8912) the Hoare annotation is: true [2022-02-20 21:13:19,123 INFO L858 garLoopResultBuilder]: For program point L7108-1(lines 7108 7110) no Hoare annotation was computed. [2022-02-20 21:13:19,123 INFO L854 garLoopResultBuilder]: At program point L7108(lines 7108 7110) the Hoare annotation is: false [2022-02-20 21:13:19,124 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-02-20 21:13:19,124 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-02-20 21:13:19,124 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-02-20 21:13:19,124 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-02-20 21:13:19,124 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-02-20 21:13:19,124 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-02-20 21:13:19,127 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 21:13:19,127 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:13:19,131 WARN L170 areAnnotationChecker]: nondet_uint64_tFINAL has no Hoare annotation [2022-02-20 21:13:19,131 WARN L170 areAnnotationChecker]: nondet_boolFINAL has no Hoare annotation [2022-02-20 21:13:19,131 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 21:13:19,147 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-02-20 21:13:19,147 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-02-20 21:13:19,147 WARN L170 areAnnotationChecker]: can_fail_allocatorFINAL has no Hoare annotation [2022-02-20 21:13:19,147 WARN L170 areAnnotationChecker]: L6257 has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: L6802-1 has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: L6884-1 has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: nondet_uint64_tFINAL has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: nondet_boolFINAL has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-02-20 21:13:19,148 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: can_fail_allocatorFINAL has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: L6257 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: L6257 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: L6802-1 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: L6884-1 has no Hoare annotation [2022-02-20 21:13:19,149 WARN L170 areAnnotationChecker]: nondet_uint64_tEXIT has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: nondet_uint64_tEXIT has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: nondet_uint64_tEXIT has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: nondet_boolEXIT has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: nondet_boolEXIT has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: nondet_boolEXIT has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: L8912-1 has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: L211-2 has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2022-02-20 21:13:19,150 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L223-3 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L8083 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: can_fail_allocatorEXIT has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L6257-2 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L6803-1 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: bounded_mallocFINAL has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L6820-1 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L7107-1 has no Hoare annotation [2022-02-20 21:13:19,151 WARN L170 areAnnotationChecker]: L6811-1 has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: L6811-1 has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: L8912-1 has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: L8912-1 has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: L8915-1 has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: L8915-1 has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,152 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: L8083 has no Hoare annotation [2022-02-20 21:13:19,153 WARN L170 areAnnotationChecker]: L6811-3 has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: L6257-3 has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: L6257-3 has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: L6803-1 has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: bounded_mallocEXIT has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: bounded_mallocEXIT has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: L7108-1 has no Hoare annotation [2022-02-20 21:13:19,154 WARN L170 areAnnotationChecker]: L6811-3 has no Hoare annotation [2022-02-20 21:13:19,155 WARN L170 areAnnotationChecker]: L6811-5 has no Hoare annotation [2022-02-20 21:13:19,155 WARN L170 areAnnotationChecker]: L8912-3 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L8912-5 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L6820-1 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L8915-3 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L6822 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L6826-1 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L7579-5 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L7108-1 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L8919-2 has no Hoare annotation [2022-02-20 21:13:19,156 WARN L170 areAnnotationChecker]: L8920-1 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L8921-1 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L7101-1 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L7101-1 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L7111-1 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L8095-4 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L8095-4 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L8097 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L6257-5 has no Hoare annotation [2022-02-20 21:13:19,157 WARN L170 areAnnotationChecker]: L6808-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L6808-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L6822 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: ensure_string_is_allocated_bounded_lengthFINAL has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L8912-3 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L8915-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7579 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7579 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L8915-3 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7580 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7580 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7111-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L8921-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7101-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7107-1 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L7100 has no Hoare annotation [2022-02-20 21:13:19,158 WARN L170 areAnnotationChecker]: L8095-4 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8097 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8097 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: aws_string_is_validFINAL has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L6811-1 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L6826-1 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: ensure_string_is_allocated_bounded_lengthFINAL has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L7579-5 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L7579-3 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8918 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L7589 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L7589 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8920-1 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8911 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: aws_array_eq_c_strFINAL has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8103 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8103 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: aws_string_is_validEXIT has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: aws_string_is_validEXIT has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: ensure_string_is_allocated_bounded_lengthEXIT has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L7579-3 has no Hoare annotation [2022-02-20 21:13:19,159 WARN L170 areAnnotationChecker]: L8918 has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: L8918 has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: L7598-1 has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: aws_array_eq_c_strEXIT has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: L8095-2 has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: L8919-2 has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: L7598-1 has no Hoare annotation [2022-02-20 21:13:19,160 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:13:19,160 INFO L163 areAnnotationChecker]: CFG has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 21:13:19,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 09:13:19 BoogieIcfgContainer [2022-02-20 21:13:19,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 21:13:19,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 21:13:19,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 21:13:19,189 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 21:13:19,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:13:10" (3/4) ... [2022-02-20 21:13:19,192 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 21:13:19,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_c_str [2022-02-20 21:13:19,197 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-02-20 21:13:19,197 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-02-20 21:13:19,212 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-02-20 21:13:19,213 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 21:13:19,214 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:13:19,214 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:13:19,266 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((str == 0 && !(str == 0)) && str == 0) && !(\result == 0) [2022-02-20 21:13:19,268 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(c_str == 0) && str == 0) && !(str == 0)) && str == 0) && !(\result == 0)) || (c_str == 0 && c_str == 0) [2022-02-20 21:13:19,269 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2022-02-20 21:13:19,421 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 21:13:19,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 21:13:19,423 INFO L158 Benchmark]: Toolchain (without parser) took 11349.25ms. Allocated memory was 113.2MB in the beginning and 390.1MB in the end (delta: 276.8MB). Free memory was 76.2MB in the beginning and 282.5MB in the end (delta: -206.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2022-02-20 21:13:19,423 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 113.2MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:13:19,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1626.71ms. Allocated memory was 113.2MB in the beginning and 172.0MB in the end (delta: 58.7MB). Free memory was 76.0MB in the beginning and 76.9MB in the end (delta: -831.5kB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2022-02-20 21:13:19,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.65ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 76.9MB in the beginning and 177.8MB in the end (delta: -101.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-20 21:13:19,424 INFO L158 Benchmark]: Boogie Preprocessor took 64.51ms. Allocated memory is still 232.8MB. Free memory was 177.8MB in the beginning and 170.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:13:19,424 INFO L158 Benchmark]: RCFGBuilder took 600.50ms. Allocated memory is still 232.8MB. Free memory was 170.5MB in the beginning and 131.7MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-02-20 21:13:19,424 INFO L158 Benchmark]: TraceAbstraction took 8694.59ms. Allocated memory was 232.8MB in the beginning and 390.1MB in the end (delta: 157.3MB). Free memory was 130.6MB in the beginning and 301.4MB in the end (delta: -170.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:13:19,424 INFO L158 Benchmark]: Witness Printer took 233.29ms. Allocated memory is still 390.1MB. Free memory was 301.4MB in the beginning and 282.5MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 21:13:19,426 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.66ms. Allocated memory is still 113.2MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1626.71ms. Allocated memory was 113.2MB in the beginning and 172.0MB in the end (delta: 58.7MB). Free memory was 76.0MB in the beginning and 76.9MB in the end (delta: -831.5kB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.65ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 76.9MB in the beginning and 177.8MB in the end (delta: -101.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.51ms. Allocated memory is still 232.8MB. Free memory was 177.8MB in the beginning and 170.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 600.50ms. Allocated memory is still 232.8MB. Free memory was 170.5MB in the beginning and 131.7MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8694.59ms. Allocated memory was 232.8MB in the beginning and 390.1MB in the end (delta: 157.3MB). Free memory was 130.6MB in the beginning and 301.4MB in the end (delta: -170.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 233.29ms. Allocated memory is still 390.1MB. Free memory was 301.4MB in the beginning and 282.5MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 1642 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1107 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1072 IncrementalHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 535 mSDtfsCounter, 1072 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 129 PreInvPairs, 152 NumberOfFragments, 407 HoareAnnotationTreeSize, 129 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 41 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 1120 SizeOfPredicates, 7 NumberOfNonLiveVariables, 911 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 259/291 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8925]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7577]: Loop Invariant Derived loop invariant: ((((!(c_str == 0) && str == 0) && !(str == 0)) && str == 0) && !(\result == 0)) || (c_str == 0 && c_str == 0) - InvariantResult [Line: 6807]: Loop Invariant Derived loop invariant: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) - InvariantResult [Line: 6819]: Loop Invariant Derived loop invariant: ((str == 0 && !(str == 0)) && str == 0) && !(\result == 0) RESULT: Ultimate proved your program to be correct! [2022-02-20 21:13:19,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE