./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 87fd6ee1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_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 9ada52fa2d2f19797875f51aa29b98afc09f0d81 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-87fd6ee [2020-12-04 18:49:41,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 18:49:41,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 18:49:41,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 18:49:41,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 18:49:41,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 18:49:41,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 18:49:41,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 18:49:41,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 18:49:41,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 18:49:41,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 18:49:41,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 18:49:41,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 18:49:41,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 18:49:41,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 18:49:41,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 18:49:41,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 18:49:41,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 18:49:41,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 18:49:41,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 18:49:41,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 18:49:41,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 18:49:41,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 18:49:41,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 18:49:41,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 18:49:41,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 18:49:41,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 18:49:41,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 18:49:41,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 18:49:41,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 18:49:41,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 18:49:41,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 18:49:41,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 18:49:41,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 18:49:41,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 18:49:41,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 18:49:41,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 18:49:41,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 18:49:41,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 18:49:41,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 18:49:41,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 18:49:41,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-04 18:49:42,008 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 18:49:42,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 18:49:42,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 18:49:42,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 18:49:42,011 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 18:49:42,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 18:49:42,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 18:49:42,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 18:49:42,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 18:49:42,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 18:49:42,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 18:49:42,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 18:49:42,013 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 18:49:42,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 18:49:42,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 18:49:42,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 18:49:42,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 18:49:42,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:49:42,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 18:49:42,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 18:49:42,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 18:49:42,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 18:49:42,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 18:49:42,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 18:49:42,017 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 18:49:42,017 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 -> 9ada52fa2d2f19797875f51aa29b98afc09f0d81 [2020-12-04 18:49:42,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 18:49:42,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 18:49:42,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 18:49:42,536 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 18:49:42,537 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 18:49:42,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i [2020-12-04 18:49:42,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0512a29e/93ccff7ffc9d4036b1ef4b62b4a03f58/FLAGb11a8c201 [2020-12-04 18:49:43,830 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 18:49:43,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i [2020-12-04 18:49:43,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0512a29e/93ccff7ffc9d4036b1ef4b62b4a03f58/FLAGb11a8c201 [2020-12-04 18:49:44,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0512a29e/93ccff7ffc9d4036b1ef4b62b4a03f58 [2020-12-04 18:49:44,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 18:49:44,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 18:49:44,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 18:49:44,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 18:49:44,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 18:49:44,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:49:44" (1/1) ... [2020-12-04 18:49:44,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc073ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:44, skipping insertion in model container [2020-12-04 18:49:44,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:49:44" (1/1) ... [2020-12-04 18:49:44,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 18:49:44,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-04 18:49:44,682 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i[4489,4502] [2020-12-04 18:49:44,691 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i[4549,4562] [2020-12-04 18:49:44,728 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:49:44,736 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:49:45,928 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,930 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,931 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,932 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,934 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,951 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,952 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,955 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,956 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,959 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,961 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,962 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:45,963 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:46,496 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:49:46,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:49:46,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:49:46,501 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:49:46,503 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:49:46,505 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:49:46,506 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:49:46,507 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:49:46,508 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:49:46,509 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:49:46,718 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:49:47,278 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,282 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,326 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,328 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,335 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,336 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,352 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,353 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,354 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,354 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,355 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,355 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,356 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:49:47,444 INFO L203 MainTranslator]: Completed pre-run [2020-12-04 18:49:47,489 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i[4489,4502] [2020-12-04 18:49:47,489 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_string_harness.i[4549,4562] [2020-12-04 18:49:47,491 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:49:47,492 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:49:47,523 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,524 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,525 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,525 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,526 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,532 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,532 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,534 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,534 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,535 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,536 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,536 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,537 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,586 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:49:47,587 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:49:47,588 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:49:47,589 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:49:47,591 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:49:47,592 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:49:47,592 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:49:47,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:49:47,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:49:47,594 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:49:47,645 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:49:47,801 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,802 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,825 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,827 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,832 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,833 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,849 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,850 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,851 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,851 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,852 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,853 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,853 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:49:47,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:49:49,136 INFO L208 MainTranslator]: Completed translation [2020-12-04 18:49:49,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49 WrapperNode [2020-12-04 18:49:49,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 18:49:49,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 18:49:49,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 18:49:49,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 18:49:49,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 18:49:49,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 18:49:49,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 18:49:49,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 18:49:49,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... [2020-12-04 18:49:49,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 18:49:49,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 18:49:49,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 18:49:49,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 18:49:49,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:49:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-04 18:49:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-04 18:49:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-04 18:49:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 18:49:49,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 18:49:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 18:49:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-04 18:49:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-04 18:49:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-04 18:49:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 18:49:59,301 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##160: assume !true; [2020-12-04 18:49:59,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 18:49:59,312 INFO L299 CfgBuilder]: Removed 45 assume(true) statements. [2020-12-04 18:49:59,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:49:59 BoogieIcfgContainer [2020-12-04 18:49:59,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 18:49:59,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 18:49:59,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 18:49:59,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 18:49:59,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 06:49:44" (1/3) ... [2020-12-04 18:49:59,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294e0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:49:59, skipping insertion in model container [2020-12-04 18:49:59,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:49:49" (2/3) ... [2020-12-04 18:49:59,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294e0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:49:59, skipping insertion in model container [2020-12-04 18:49:59,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:49:59" (3/3) ... [2020-12-04 18:49:59,324 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_string_harness.i [2020-12-04 18:49:59,339 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 18:49:59,344 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-04 18:49:59,356 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-04 18:49:59,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 18:49:59,384 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 18:49:59,384 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 18:49:59,384 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 18:49:59,384 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 18:49:59,385 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 18:49:59,385 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 18:49:59,385 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 18:49:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2020-12-04 18:49:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:49:59,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:49:59,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:49:59,411 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:49:59,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:49:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2017125498, now seen corresponding path program 1 times [2020-12-04 18:49:59,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:49:59,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089737729] [2020-12-04 18:49:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:50:00,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089737729] [2020-12-04 18:50:00,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:50:00,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 18:50:00,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924864847] [2020-12-04 18:50:00,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 18:50:00,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:50:00,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 18:50:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:50:00,355 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2020-12-04 18:50:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:00,416 INFO L93 Difference]: Finished difference Result 225 states and 346 transitions. [2020-12-04 18:50:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 18:50:00,424 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2020-12-04 18:50:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:00,436 INFO L225 Difference]: With dead ends: 225 [2020-12-04 18:50:00,436 INFO L226 Difference]: Without dead ends: 108 [2020-12-04 18:50:00,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:50:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-04 18:50:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-12-04 18:50:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-04 18:50:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2020-12-04 18:50:00,482 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 44 [2020-12-04 18:50:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:00,483 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2020-12-04 18:50:00,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 18:50:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2020-12-04 18:50:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:50:00,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:50:00,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:50:00,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 18:50:00,486 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:50:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:50:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1074584392, now seen corresponding path program 1 times [2020-12-04 18:50:00,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:50:00,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217709837] [2020-12-04 18:50:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:50:08,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217709837] [2020-12-04 18:50:08,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:50:08,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-04 18:50:08,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573028372] [2020-12-04 18:50:08,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-04 18:50:08,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:50:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-04 18:50:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:50:08,467 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 18 states. [2020-12-04 18:50:36,028 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-04 18:50:36,455 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-04 18:50:37,186 WARN L197 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2020-12-04 18:50:37,999 WARN L197 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-12-04 18:50:38,837 WARN L197 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2020-12-04 18:50:39,852 WARN L197 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 101 [2020-12-04 18:50:40,751 WARN L197 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 88 [2020-12-04 18:50:41,604 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 50 [2020-12-04 18:50:42,253 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2020-12-04 18:50:42,948 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 59 [2020-12-04 18:50:43,440 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-12-04 18:50:44,392 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 60 [2020-12-04 18:50:45,095 WARN L197 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 62 [2020-12-04 18:50:45,899 WARN L197 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 67 [2020-12-04 18:50:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:47,456 INFO L93 Difference]: Finished difference Result 212 states and 308 transitions. [2020-12-04 18:50:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-04 18:50:47,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-12-04 18:50:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:47,462 INFO L225 Difference]: With dead ends: 212 [2020-12-04 18:50:47,462 INFO L226 Difference]: Without dead ends: 207 [2020-12-04 18:50:47,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2020-12-04 18:50:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-04 18:50:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 118. [2020-12-04 18:50:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-04 18:50:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 173 transitions. [2020-12-04 18:50:47,490 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 173 transitions. Word has length 44 [2020-12-04 18:50:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:47,490 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 173 transitions. [2020-12-04 18:50:47,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-04 18:50:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 173 transitions. [2020-12-04 18:50:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:50:47,493 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:50:47,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:50:47,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 18:50:47,495 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:50:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:50:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1076431434, now seen corresponding path program 1 times [2020-12-04 18:50:47,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:50:47,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263715851] [2020-12-04 18:50:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:50:48,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263715851] [2020-12-04 18:50:48,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:50:48,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:50:48,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064143235] [2020-12-04 18:50:48,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:50:48,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:50:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:50:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:50:48,251 INFO L87 Difference]: Start difference. First operand 118 states and 173 transitions. Second operand 11 states. [2020-12-04 18:50:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:49,286 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2020-12-04 18:50:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 18:50:49,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-12-04 18:50:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:49,297 INFO L225 Difference]: With dead ends: 230 [2020-12-04 18:50:49,297 INFO L226 Difference]: Without dead ends: 127 [2020-12-04 18:50:49,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2020-12-04 18:50:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-04 18:50:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2020-12-04 18:50:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-04 18:50:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2020-12-04 18:50:49,330 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 44 [2020-12-04 18:50:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:49,331 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2020-12-04 18:50:49,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:50:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2020-12-04 18:50:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:50:49,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:50:49,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:50:49,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-04 18:50:49,334 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:50:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:50:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1443528500, now seen corresponding path program 1 times [2020-12-04 18:50:49,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:50:49,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066613626] [2020-12-04 18:50:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:50:49,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066613626] [2020-12-04 18:50:49,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:50:49,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 18:50:49,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486026506] [2020-12-04 18:50:49,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 18:50:49,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:50:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 18:50:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:50:49,836 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand 10 states. [2020-12-04 18:50:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:50,448 INFO L93 Difference]: Finished difference Result 323 states and 476 transitions. [2020-12-04 18:50:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 18:50:50,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2020-12-04 18:50:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:50,462 INFO L225 Difference]: With dead ends: 323 [2020-12-04 18:50:50,463 INFO L226 Difference]: Without dead ends: 220 [2020-12-04 18:50:50,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:50:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-04 18:50:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 211. [2020-12-04 18:50:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-04 18:50:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 312 transitions. [2020-12-04 18:50:50,518 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 312 transitions. Word has length 44 [2020-12-04 18:50:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:50,518 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 312 transitions. [2020-12-04 18:50:50,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 18:50:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 312 transitions. [2020-12-04 18:50:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:50:50,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:50:50,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:50:50,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-04 18:50:50,522 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:50:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:50:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -741928626, now seen corresponding path program 1 times [2020-12-04 18:50:50,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:50:50,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806953506] [2020-12-04 18:50:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:50:50,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806953506] [2020-12-04 18:50:50,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:50:50,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:50:50,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250243258] [2020-12-04 18:50:50,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:50:50,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:50:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:50:50,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:50:50,844 INFO L87 Difference]: Start difference. First operand 211 states and 312 transitions. Second operand 7 states. [2020-12-04 18:50:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:50:51,098 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2020-12-04 18:50:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:50:51,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-12-04 18:50:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:50:51,101 INFO L225 Difference]: With dead ends: 218 [2020-12-04 18:50:51,101 INFO L226 Difference]: Without dead ends: 111 [2020-12-04 18:50:51,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:50:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-04 18:50:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-12-04 18:50:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-12-04 18:50:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2020-12-04 18:50:51,112 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 44 [2020-12-04 18:50:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:50:51,112 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2020-12-04 18:50:51,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:50:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2020-12-04 18:50:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-04 18:50:51,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:50:51,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:50:51,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-04 18:50:51,115 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:50:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:50:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 696125303, now seen corresponding path program 1 times [2020-12-04 18:50:51,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:50:51,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470988803] [2020-12-04 18:50:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:50:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:50:57,350 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2020-12-04 18:50:57,533 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2020-12-04 18:50:57,724 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-12-04 18:50:57,966 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-12-04 18:50:58,239 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2020-12-04 18:50:58,448 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-12-04 18:50:58,650 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-12-04 18:50:58,852 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-12-04 18:50:59,056 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-12-04 18:50:59,273 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-12-04 18:51:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:51:00,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470988803] [2020-12-04 18:51:00,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:51:00,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-12-04 18:51:00,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304006432] [2020-12-04 18:51:00,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-04 18:51:00,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:51:00,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-04 18:51:00,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2020-12-04 18:51:00,183 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand 23 states. [2020-12-04 18:51:32,233 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-04 18:51:32,689 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-12-04 18:51:33,050 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-12-04 18:51:33,514 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-04 18:51:33,848 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-12-04 18:51:34,439 WARN L197 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-12-04 18:51:35,181 WARN L197 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2020-12-04 18:51:35,987 WARN L197 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2020-12-04 18:51:37,134 WARN L197 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2020-12-04 18:51:38,240 WARN L197 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 76 [2020-12-04 18:51:41,207 WARN L197 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 77 [2020-12-04 18:51:42,421 WARN L197 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 79 [2020-12-04 18:51:43,629 WARN L197 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 83 [2020-12-04 18:51:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:51:45,562 INFO L93 Difference]: Finished difference Result 207 states and 291 transitions. [2020-12-04 18:51:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-04 18:51:45,568 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2020-12-04 18:51:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:51:45,570 INFO L225 Difference]: With dead ends: 207 [2020-12-04 18:51:45,571 INFO L226 Difference]: Without dead ends: 195 [2020-12-04 18:51:45,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2020-12-04 18:51:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-12-04 18:51:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 112. [2020-12-04 18:51:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-04 18:51:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2020-12-04 18:51:45,586 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 45 [2020-12-04 18:51:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:51:45,587 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2020-12-04 18:51:45,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-04 18:51:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2020-12-04 18:51:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-04 18:51:45,588 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:51:45,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:51:45,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-04 18:51:45,588 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:51:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:51:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1023752481, now seen corresponding path program 1 times [2020-12-04 18:51:45,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:51:45,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993845358] [2020-12-04 18:51:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:51:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:51:50,531 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2020-12-04 18:51:50,687 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2020-12-04 18:51:50,855 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2020-12-04 18:51:51,117 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-12-04 18:51:51,347 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-12-04 18:51:51,591 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-12-04 18:51:51,846 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2020-12-04 18:51:52,111 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2020-12-04 18:51:52,470 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-12-04 18:51:52,819 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2020-12-04 18:51:53,105 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2020-12-04 18:51:53,357 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2020-12-04 18:51:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:51:54,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993845358] [2020-12-04 18:51:54,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251493808] [2020-12-04 18:51:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 18:51:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:51:55,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 2373 conjuncts, 140 conjunts are in the unsatisfiable core [2020-12-04 18:51:55,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 18:51:56,404 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-04 18:51:56,405 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2020-12-04 18:51:56,409 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:51:56,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:51:56,456 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:51:56,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2020-12-04 18:51:58,096 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2020-12-04 18:51:58,450 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-04 18:51:59,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-04 18:51:59,506 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:51:59,506 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2020-12-04 18:51:59,511 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:51:59,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:51:59,595 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:51:59,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2020-12-04 18:52:00,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-04 18:52:00,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-04 18:52:00,594 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-12-04 18:52:00,596 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 18:52:00,596 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 71 [2020-12-04 18:52:00,603 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 18:52:00,850 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-04 18:52:00,853 INFO L625 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2020-12-04 18:52:00,879 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 18:52:00,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:56, output treesize:19 [2020-12-04 18:52:01,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 18:52:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:52:01,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-04 18:52:01,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2020-12-04 18:52:01,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653179868] [2020-12-04 18:52:01,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-12-04 18:52:01,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:52:01,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-12-04 18:52:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2020-12-04 18:52:01,784 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand 37 states. [2020-12-04 18:52:29,532 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-04 18:52:29,948 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-04 18:52:30,367 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-04 18:52:30,904 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-04 18:52:31,402 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-04 18:52:32,429 WARN L197 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2020-12-04 18:52:33,428 WARN L197 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2020-12-04 18:52:34,325 WARN L197 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2020-12-04 18:52:35,392 WARN L197 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2020-12-04 18:52:36,578 WARN L197 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 87 [2020-12-04 18:52:37,844 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 128 DAG size of output: 89 [2020-12-04 18:52:39,325 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-12-04 18:52:40,692 WARN L197 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2020-12-04 18:52:42,520 WARN L197 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2020-12-04 18:52:43,662 WARN L197 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2020-12-04 18:52:45,281 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 146 DAG size of output: 95 [2020-12-04 18:52:47,394 WARN L197 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2020-12-04 18:52:48,772 WARN L197 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2020-12-04 18:52:50,027 WARN L197 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2020-12-04 18:52:50,899 WARN L197 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-12-04 18:52:51,874 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2020-12-04 18:52:53,182 WARN L197 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 71 [2020-12-04 18:52:54,202 WARN L197 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-12-04 18:52:55,386 WARN L197 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2020-12-04 18:52:56,752 WARN L197 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2020-12-04 18:52:57,747 WARN L197 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-12-04 18:52:58,743 WARN L197 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2020-12-04 18:53:00,109 WARN L197 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-12-04 18:53:01,482 WARN L197 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 72 [2020-12-04 18:53:02,828 WARN L197 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2020-12-04 18:53:04,129 WARN L197 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-12-04 18:53:05,043 WARN L197 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-12-04 18:53:06,072 WARN L197 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-12-04 18:53:07,487 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2020-12-04 18:53:08,492 WARN L197 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-12-04 18:53:09,699 WARN L197 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2020-12-04 18:53:10,972 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2020-12-04 18:53:11,869 WARN L197 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-12-04 18:53:12,874 WARN L197 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2020-12-04 18:53:14,471 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 135 DAG size of output: 96 [2020-12-04 18:53:15,433 WARN L197 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-12-04 18:53:17,176 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2020-12-04 18:53:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:53:19,321 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2020-12-04 18:53:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-12-04 18:53:19,330 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 45 [2020-12-04 18:53:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:53:19,331 INFO L225 Difference]: With dead ends: 237 [2020-12-04 18:53:19,331 INFO L226 Difference]: Without dead ends: 0 [2020-12-04 18:53:19,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=1415, Invalid=5065, Unknown=0, NotChecked=0, Total=6480 [2020-12-04 18:53:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-04 18:53:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-04 18:53:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-04 18:53:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-04 18:53:19,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-12-04 18:53:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:53:19,336 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-04 18:53:19,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-12-04 18:53:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-04 18:53:19,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-04 18:53:19,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-04 18:53:19,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-04 18:53:19,798 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 176 [2020-12-04 18:53:20,122 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 234 [2020-12-04 18:53:20,295 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 189 [2020-12-04 18:53:20,615 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 183 [2020-12-04 18:53:20,820 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 183 [2020-12-04 18:53:22,358 WARN L197 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 135 DAG size of output: 86 [2020-12-04 18:53:24,676 WARN L197 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 192 DAG size of output: 95 [2020-12-04 18:53:27,310 WARN L197 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 176 DAG size of output: 95 [2020-12-04 18:53:35,483 WARN L197 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 234 DAG size of output: 173 [2020-12-04 18:53:40,738 WARN L197 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 187 DAG size of output: 125 [2020-12-04 18:53:41,075 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-12-04 18:53:41,789 WARN L197 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2020-12-04 18:53:44,449 WARN L197 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 176 DAG size of output: 95 [2020-12-04 18:53:44,922 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-04 18:53:47,426 WARN L197 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 176 DAG size of output: 95 [2020-12-04 18:53:52,632 WARN L197 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 182 DAG size of output: 123 [2020-12-04 18:53:55,094 WARN L197 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 176 DAG size of output: 95 [2020-12-04 18:53:56,104 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 131 DAG size of output: 81 [2020-12-04 18:54:01,243 WARN L197 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 182 DAG size of output: 123 [2020-12-04 18:54:01,348 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-04 18:54:01,354 INFO L262 CegarLoopResult]: For program point L8921(line 8921) no Hoare annotation was computed. [2020-12-04 18:54:01,354 INFO L262 CegarLoopResult]: For program point L8921-2(line 8921) no Hoare annotation was computed. [2020-12-04 18:54:01,354 INFO L262 CegarLoopResult]: For program point L8971(line 8971) no Hoare annotation was computed. [2020-12-04 18:54:01,354 INFO L262 CegarLoopResult]: For program point L8872(line 8872) no Hoare annotation was computed. [2020-12-04 18:54:01,355 INFO L262 CegarLoopResult]: For program point L8922(line 8922) no Hoare annotation was computed. [2020-12-04 18:54:01,355 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-04 18:54:01,355 INFO L262 CegarLoopResult]: For program point L8856-3(lines 8856 8864) no Hoare annotation was computed. [2020-12-04 18:54:01,355 INFO L258 CegarLoopResult]: At program point L8856-2(lines 8856 8864) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (< .cse0 ULTIMATE.start_hashlittle2_~pc.base) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse0 ULTIMATE.start_hashlittle2_~pb.base) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|) (= ULTIMATE.start_aws_string_is_valid_~str.offset 0) (= ULTIMATE.start_aws_hash_string_~str~3.base ULTIMATE.start_hashlittle2_~k~3.base) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base) (= (let ((.cse2 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (= (let ((.cse3 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse3 (+ (mod (select .cse3 8) 4294967296) 12))) 0) (<= (+ |ULTIMATE.start_aws_string_bytes_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) [2020-12-04 18:54:01,355 INFO L262 CegarLoopResult]: For program point L8873(line 8873) no Hoare annotation was computed. [2020-12-04 18:54:01,356 INFO L258 CegarLoopResult]: At program point L8956(lines 8956 8972) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< .cse0 ULTIMATE.start_hashlittle2_~pc.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse0 ULTIMATE.start_hashlittle2_~pb.base) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|) (= ULTIMATE.start_aws_hash_string_~item.offset 0) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base) (= (let ((.cse2 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (= (let ((.cse3 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse3 (+ (mod (select .cse3 8) 4294967296) 12))) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) [2020-12-04 18:54:01,356 INFO L258 CegarLoopResult]: At program point L8890-2(lines 8890 8898) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< .cse0 ULTIMATE.start_hashlittle2_~pc.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse0 ULTIMATE.start_hashlittle2_~pb.base) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|) (= ULTIMATE.start_aws_hash_string_~item.offset 0) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base) (= (let ((.cse2 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (= (let ((.cse3 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse3 (+ (mod (select .cse3 8) 4294967296) 12))) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) [2020-12-04 18:54:01,357 INFO L262 CegarLoopResult]: For program point L8890-3(lines 8890 8898) no Hoare annotation was computed. [2020-12-04 18:54:01,357 INFO L262 CegarLoopResult]: For program point L8874(line 8874) no Hoare annotation was computed. [2020-12-04 18:54:01,357 INFO L262 CegarLoopResult]: For program point L8924(line 8924) no Hoare annotation was computed. [2020-12-04 18:54:01,357 INFO L262 CegarLoopResult]: For program point L8924-2(line 8924) no Hoare annotation was computed. [2020-12-04 18:54:01,357 INFO L258 CegarLoopResult]: At program point L6876(lines 6867 6877) the Hoare annotation is: (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) [2020-12-04 18:54:01,357 INFO L262 CegarLoopResult]: For program point L8908(line 8908) no Hoare annotation was computed. [2020-12-04 18:54:01,357 INFO L262 CegarLoopResult]: For program point L8875(line 8875) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8908-2(line 8908) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L10246(lines 10246 10249) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8925(line 8925) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8958-2(line 8958) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8958(line 8958) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8909(line 8909) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8876(line 8876) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L8959-2(line 8959) no Hoare annotation was computed. [2020-12-04 18:54:01,358 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:54:01,359 INFO L262 CegarLoopResult]: For program point L8959(line 8959) no Hoare annotation was computed. [2020-12-04 18:54:01,359 INFO L262 CegarLoopResult]: For program point L8877(line 8877) no Hoare annotation was computed. [2020-12-04 18:54:01,359 INFO L258 CegarLoopResult]: At program point L9951-2(line 9951) the Hoare annotation is: (let ((.cse2 (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|)) (.cse4 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse6 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|)) (.cse7 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse8 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|)) (.cse13 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse17 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse0 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_hash_string_~item.base 0))) (.cse18 (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse25 (not (= |ULTIMATE.start_aws_hash_string_~#c~8.base| |ULTIMATE.start_aws_string_bytes_#res.base|))) (.cse3 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse5 (= ULTIMATE.start_aws_hash_string_~str~3.offset 0)) (.cse19 (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0))) (.cse20 (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse10 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse29 (<= (+ |ULTIMATE.start_aws_string_bytes_#res.base| 1) |#StackHeapBarrier|)) (.cse11 (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|)) (.cse30 (not (= ULTIMATE.start_aws_string_bytes_~str.base |ULTIMATE.start_aws_hash_string_~#b~6.base|))) (.cse31 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_string_~str~3.base))) (.cse12 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse14 (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|)) (.cse32 (not (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_hashlittle2_~pc.base))) (.cse15 (= ULTIMATE.start_aws_hash_string_~item.offset 0)) (.cse16 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse24 (= ULTIMATE.start_aws_hash_string_~str~3.base ULTIMATE.start_hashlittle2_~k~3.base))) (or (let ((.cse9 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 ULTIMATE.start_hashlittle2_~pc.base) .cse10 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse9 ULTIMATE.start_hashlittle2_~pb.base) .cse11 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) .cse12 .cse13 .cse14 .cse15 .cse16 (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) .cse17 (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) .cse18 .cse19 .cse20 (= (let ((.cse21 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse21 (+ (mod (select .cse21 8) 4294967296) 12))) 0) (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse22 (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) (let ((.cse27 (select |#memory_int| ULTIMATE.start_aws_string_is_valid_~str.base))) (let ((.cse28 (select .cse27 (+ ULTIMATE.start_aws_string_is_valid_~str.offset 8)))) (and .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= ULTIMATE.start_hashlittle2_~length (select (select |#memory_int| ULTIMATE.start_hashlittle2_~k~3.base) 8)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse25 .cse19 (let ((.cse26 (select .cse27 ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE))) (<= .cse26 (* 256 (div .cse26 256)))) .cse20 (<= .cse28 11) (<= 11 .cse28) .cse29 .cse30 .cse22 .cse31 .cse32))) (and .cse1 .cse0 .cse23 .cse18 .cse25 .cse3 .cse5 .cse19 .cse20 .cse10 .cse29 (= (select (select |#memory_int| ULTIMATE.start_hashlittle2_~key.base) 24) 0) .cse11 .cse30 .cse31 .cse12 .cse14 .cse32 .cse15 .cse16 (= (select (select |#memory_int| ULTIMATE.start_aws_hash_string_~str~3.base) (+ ULTIMATE.start_aws_hash_string_~str~3.offset 8)) 12) .cse24))) [2020-12-04 18:54:01,359 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-04 18:54:01,359 INFO L262 CegarLoopResult]: For program point L9951-3(line 9951) no Hoare annotation was computed. [2020-12-04 18:54:01,359 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-04 18:54:01,359 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-04 18:54:01,360 INFO L262 CegarLoopResult]: For program point L8960(line 8960) no Hoare annotation was computed. [2020-12-04 18:54:01,360 INFO L262 CegarLoopResult]: For program point L8927(line 8927) no Hoare annotation was computed. [2020-12-04 18:54:01,360 INFO L262 CegarLoopResult]: For program point L8960-2(line 8960) no Hoare annotation was computed. [2020-12-04 18:54:01,360 INFO L262 CegarLoopResult]: For program point L8878(line 8878) no Hoare annotation was computed. [2020-12-04 18:54:01,360 INFO L262 CegarLoopResult]: For program point L8961(line 8961) no Hoare annotation was computed. [2020-12-04 18:54:01,360 INFO L262 CegarLoopResult]: For program point L8961-2(line 8961) no Hoare annotation was computed. [2020-12-04 18:54:01,361 INFO L258 CegarLoopResult]: At program point L6864(lines 6861 6865) the Hoare annotation is: (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) [2020-12-04 18:54:01,361 INFO L265 CegarLoopResult]: At program point L10250(line 10250) the Hoare annotation is: true [2020-12-04 18:54:01,361 INFO L262 CegarLoopResult]: For program point L8879(line 8879) no Hoare annotation was computed. [2020-12-04 18:54:01,361 INFO L262 CegarLoopResult]: For program point L8962(line 8962) no Hoare annotation was computed. [2020-12-04 18:54:01,361 INFO L258 CegarLoopResult]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1)) [2020-12-04 18:54:01,362 INFO L262 CegarLoopResult]: For program point L8929(line 8929) no Hoare annotation was computed. [2020-12-04 18:54:01,362 INFO L262 CegarLoopResult]: For program point L8962-2(line 8962) no Hoare annotation was computed. [2020-12-04 18:54:01,362 INFO L262 CegarLoopResult]: For program point L8913(line 8913) no Hoare annotation was computed. [2020-12-04 18:54:01,362 INFO L262 CegarLoopResult]: For program point L8880(line 8880) no Hoare annotation was computed. [2020-12-04 18:54:01,362 INFO L262 CegarLoopResult]: For program point L8913-2(line 8913) no Hoare annotation was computed. [2020-12-04 18:54:01,363 INFO L262 CegarLoopResult]: For program point L8963(line 8963) no Hoare annotation was computed. [2020-12-04 18:54:01,363 INFO L262 CegarLoopResult]: For program point L8963-2(line 8963) no Hoare annotation was computed. [2020-12-04 18:54:01,363 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-04 18:54:01,363 INFO L262 CegarLoopResult]: For program point L8914(line 8914) no Hoare annotation was computed. [2020-12-04 18:54:01,363 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:54:01,363 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:54:01,364 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:54:01,364 INFO L262 CegarLoopResult]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:54:01,364 INFO L262 CegarLoopResult]: For program point L8881(line 8881) no Hoare annotation was computed. [2020-12-04 18:54:01,364 INFO L262 CegarLoopResult]: For program point L8964(line 8964) no Hoare annotation was computed. [2020-12-04 18:54:01,364 INFO L262 CegarLoopResult]: For program point L8964-2(line 8964) no Hoare annotation was computed. [2020-12-04 18:54:01,364 INFO L262 CegarLoopResult]: For program point L6305-2(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,365 INFO L262 CegarLoopResult]: For program point L6305-3(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,365 INFO L262 CegarLoopResult]: For program point L6305(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,365 INFO L258 CegarLoopResult]: At program point L6305-6(lines 6301 6306) the Hoare annotation is: (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (not (= ULTIMATE.start_aws_hash_string_~item.base 0)) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (<= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= (let ((.cse2 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= |ULTIMATE.start_aws_string_is_valid_#res| 1) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) [2020-12-04 18:54:01,365 INFO L262 CegarLoopResult]: For program point L6305-7(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L6305-5(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L6305-10(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L6305-9(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L8882(line 8882) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L6305-14(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-04 18:54:01,366 INFO L262 CegarLoopResult]: For program point L6305-12(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,367 INFO L258 CegarLoopResult]: At program point L6305-13(lines 6301 6306) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= ULTIMATE.start_aws_string_is_valid_~str.offset 0) (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (<= (+ ULTIMATE.start_aws_hash_string_~str~3.base 1) |#StackHeapBarrier|) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= (let ((.cse2 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset)) [2020-12-04 18:54:01,367 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-04 18:54:01,367 INFO L262 CegarLoopResult]: For program point L6305-19(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,367 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-04 18:54:01,368 INFO L262 CegarLoopResult]: For program point L6305-16(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,368 INFO L262 CegarLoopResult]: For program point L6305-17(line 6305) no Hoare annotation was computed. [2020-12-04 18:54:01,368 INFO L262 CegarLoopResult]: For program point L211-6(line 211) no Hoare annotation was computed. [2020-12-04 18:54:01,369 INFO L258 CegarLoopResult]: At program point L6305-20(lines 6301 6306) the Hoare annotation is: (let ((.cse11 (select |#memory_int| ULTIMATE.start_aws_string_is_valid_~str.base))) (let ((.cse19 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse20 (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|)) (.cse3 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse21 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse4 (= ULTIMATE.start_aws_hash_string_~str~3.offset 0)) (.cse22 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|)) (.cse23 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse24 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|)) (.cse6 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse10 (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|)) (.cse14 (<= |ULTIMATE.start_aws_string_is_valid_#res| 1)) (.cse26 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse27 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse15 (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|)) (.cse17 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse18 (= ULTIMATE.start_aws_hash_string_~str~3.base ULTIMATE.start_hashlittle2_~k~3.base)) (.cse28 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse1 (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse2 (not (= |ULTIMATE.start_aws_hash_string_~#c~8.base| |ULTIMATE.start_aws_string_bytes_#res.base|))) (.cse5 (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse7 (select .cse11 (+ ULTIMATE.start_aws_string_is_valid_~str.offset 8))) (.cse8 (<= 1 |ULTIMATE.start_aws_string_is_valid_#res|)) (.cse9 (<= (+ |ULTIMATE.start_aws_string_bytes_#res.base| 1) |#StackHeapBarrier|)) (.cse12 (not (= ULTIMATE.start_aws_string_bytes_~str.base |ULTIMATE.start_aws_hash_string_~#b~6.base|))) (.cse30 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_string_~str~3.base))) (.cse16 (not (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_hashlittle2_~pc.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 12) .cse8 .cse9 (= (select (select |#memory_int| ULTIMATE.start_hashlittle2_~key.base) 24) 0) .cse10 (= (select .cse11 24) 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (select (select |#memory_int| ULTIMATE.start_aws_hash_string_~str~3.base) (+ ULTIMATE.start_aws_hash_string_~str~3.offset 8)) 12) .cse18) (let ((.cse25 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and .cse19 .cse0 .cse20 (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) .cse3 .cse21 .cse4 .cse22 .cse23 .cse24 .cse6 (< .cse25 ULTIMATE.start_hashlittle2_~pc.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse25 ULTIMATE.start_hashlittle2_~pb.base) .cse10 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) .cse26 .cse27 .cse15 .cse17 (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) .cse28 (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) .cse1 .cse5 (= (let ((.cse29 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse29 (+ (mod (select .cse29 8) 4294967296) 12))) 0) .cse30 (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) (and .cse19 .cse0 .cse20 .cse3 .cse21 .cse4 .cse22 .cse23 .cse24 .cse6 .cse10 (= ULTIMATE.start_hashlittle2_~length (select (select |#memory_int| ULTIMATE.start_hashlittle2_~k~3.base) 8)) .cse14 .cse26 .cse27 .cse15 (= ULTIMATE.start_aws_hash_string_~item.offset 0) .cse17 .cse18 .cse28 .cse1 .cse2 (let ((.cse31 (select .cse11 ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE))) (<= .cse31 (* 256 (div .cse31 256)))) .cse5 (<= .cse7 11) (<= 11 .cse7) .cse8 .cse9 .cse12 .cse30 .cse13 .cse16)))) [2020-12-04 18:54:01,369 INFO L262 CegarLoopResult]: For program point L8965(line 8965) no Hoare annotation was computed. [2020-12-04 18:54:01,369 INFO L262 CegarLoopResult]: For program point L8965-2(line 8965) no Hoare annotation was computed. [2020-12-04 18:54:01,369 INFO L258 CegarLoopResult]: At program point L261(line 261) the Hoare annotation is: (and (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) [2020-12-04 18:54:01,369 INFO L258 CegarLoopResult]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) [2020-12-04 18:54:01,370 INFO L262 CegarLoopResult]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2020-12-04 18:54:01,370 INFO L262 CegarLoopResult]: For program point L8966(line 8966) no Hoare annotation was computed. [2020-12-04 18:54:01,370 INFO L262 CegarLoopResult]: For program point L8917(line 8917) no Hoare annotation was computed. [2020-12-04 18:54:01,370 INFO L262 CegarLoopResult]: For program point L8917-2(line 8917) no Hoare annotation was computed. [2020-12-04 18:54:01,370 INFO L262 CegarLoopResult]: For program point L8967-2(line 8967) no Hoare annotation was computed. [2020-12-04 18:54:01,371 INFO L258 CegarLoopResult]: At program point L8868(lines 8868 8883) the Hoare annotation is: (let ((.cse23 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base)) (.cse21 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|)) (.cse15 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (let ((.cse16 (select .cse15 8)) (.cse22 (select .cse21 8)) (.cse24 (select .cse23 8)) (.cse44 (select |#memory_int| ULTIMATE.start_hashlittle2_~key.base))) (let ((.cse43 (+ ULTIMATE.start_aws_hash_string_~str~3.offset 8)) (.cse40 (= (select .cse44 24) 0)) (.cse35 (not (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_hashlittle2_~pc.base))) (.cse36 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse37 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse38 (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|)) (.cse39 (or (= (select .cse23 24) 0) (<= .cse24 11) (<= 13 .cse24))) (.cse41 (or (<= .cse22 11) (<= 13 .cse22) (= (select .cse21 24) 0))) (.cse42 (or (= (select .cse15 24) 0) (<= 13 .cse16) (<= .cse16 11)))) (let ((.cse1 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse3 (or (and .cse36 .cse37 .cse38 (not (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_hashlittle2_~pb.base)) (or (not (= ULTIMATE.start_hashlittle2_~length 12)) (= (select .cse44 .cse43) 12)) .cse39 .cse41 .cse42 (let ((.cse45 (select .cse44 8))) (or (<= 13 .cse45) (<= .cse45 11) .cse40)) .cse35) (and (let ((.cse47 (select |#memory_int| ULTIMATE.start_aws_string_bytes_~str.base))) (let ((.cse46 (select .cse47 8))) (or (<= .cse46 11) (= (select .cse47 24) 0) (<= 13 .cse46)))) .cse36 .cse37 .cse38 .cse39 .cse41 .cse42))) (.cse5 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse11 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse17 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse25 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse26 (not (= ULTIMATE.start_aws_hash_string_~item.base 0))) (.cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse2 (= ULTIMATE.start_aws_hash_string_~str~3.offset 0)) (.cse4 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|)) (.cse6 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|)) (.cse8 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse9 (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|)) (.cse10 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse12 (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|)) (.cse27 (= ULTIMATE.start_aws_hash_string_~item.offset 0)) (.cse13 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse14 (= ULTIMATE.start_aws_hash_string_~str~3.base ULTIMATE.start_hashlittle2_~k~3.base)) (.cse18 (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse28 (not (= |ULTIMATE.start_aws_hash_string_~#c~8.base| |ULTIMATE.start_aws_string_bytes_#res.base|))) (.cse19 (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0))) (.cse20 (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse32 (<= (+ |ULTIMATE.start_aws_string_bytes_#res.base| 1) |#StackHeapBarrier|)) (.cse33 (not (= ULTIMATE.start_aws_string_bytes_~str.base |ULTIMATE.start_aws_hash_string_~#b~6.base|))) (.cse34 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_string_~str~3.base)))) (or (let ((.cse7 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse7 ULTIMATE.start_hashlittle2_~pc.base) .cse8 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse7 ULTIMATE.start_hashlittle2_~pb.base) .cse9 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) .cse10 .cse11 .cse12 .cse13 .cse14 (= (select .cse15 (+ (mod .cse16 4294967296) 12)) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) .cse17 (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) .cse18 .cse19 .cse20 (= (select .cse21 (+ (mod .cse22 4294967296) 12)) 0) (= (select .cse23 (+ (mod .cse24 4294967296) 12)) 0) .cse25 (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) (let ((.cse30 (select |#memory_int| ULTIMATE.start_aws_string_is_valid_~str.base))) (let ((.cse31 (select .cse30 (+ ULTIMATE.start_aws_string_is_valid_~str.offset 8)))) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ULTIMATE.start_hashlittle2_~length (select (select |#memory_int| ULTIMATE.start_hashlittle2_~k~3.base) 8)) .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse17 .cse18 .cse28 .cse19 (let ((.cse29 (select .cse30 ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE))) (<= .cse29 (* 256 (div .cse29 256)))) .cse20 (<= .cse31 11) (<= 11 .cse31) .cse32 .cse33 .cse25 .cse34 .cse35))) (and .cse36 .cse37 .cse38 .cse26 .cse0 .cse39 .cse2 .cse4 .cse6 .cse8 .cse40 .cse9 .cse10 .cse41 .cse42 .cse12 .cse27 .cse13 .cse14 .cse18 .cse28 .cse19 .cse20 .cse32 .cse33 .cse34 .cse35 (= (select (select |#memory_int| ULTIMATE.start_aws_hash_string_~str~3.base) .cse43) 12))))))) [2020-12-04 18:54:01,371 INFO L262 CegarLoopResult]: For program point L8967(line 8967) no Hoare annotation was computed. [2020-12-04 18:54:01,372 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-04 18:54:01,372 INFO L262 CegarLoopResult]: For program point L8852(line 8852) no Hoare annotation was computed. [2020-12-04 18:54:01,372 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:54:01,372 INFO L262 CegarLoopResult]: For program point L8852-2(lines 8852 8973) no Hoare annotation was computed. [2020-12-04 18:54:01,372 INFO L262 CegarLoopResult]: For program point L8918(line 8918) no Hoare annotation was computed. [2020-12-04 18:54:01,372 INFO L262 CegarLoopResult]: For program point L8968(line 8968) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L258 CegarLoopResult]: At program point L8902(lines 8902 8930) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< .cse0 ULTIMATE.start_hashlittle2_~pc.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse0 ULTIMATE.start_hashlittle2_~pb.base) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|) (= ULTIMATE.start_aws_hash_string_~item.offset 0) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base) (= (let ((.cse2 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (= (let ((.cse3 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse3 (+ (mod (select .cse3 8) 4294967296) 12))) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L6871(lines 6871 6872) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L8886-2(lines 8886 8973) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L8886-4(lines 8852 8973) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L6871-2(lines 6871 6872) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L8886(line 8886) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L8936-3(lines 8936 8953) no Hoare annotation was computed. [2020-12-04 18:54:01,373 INFO L262 CegarLoopResult]: For program point L8969(line 8969) no Hoare annotation was computed. [2020-12-04 18:54:01,374 INFO L262 CegarLoopResult]: For program point L8870(line 8870) no Hoare annotation was computed. [2020-12-04 18:54:01,374 INFO L258 CegarLoopResult]: At program point L8936-2(lines 8936 8953) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< .cse0 ULTIMATE.start_hashlittle2_~pc.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse0 ULTIMATE.start_hashlittle2_~pb.base) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|) (= ULTIMATE.start_aws_hash_string_~item.offset 0) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base) (= (let ((.cse2 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (= (let ((.cse3 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse3 (+ (mod (select .cse3 8) 4294967296) 12))) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) [2020-12-04 18:54:01,374 INFO L258 CegarLoopResult]: At program point L6294(lines 6291 6295) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (= ULTIMATE.start_aws_hash_string_~str~3.offset 0) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|) (= ULTIMATE.start_aws_string_is_valid_~str.offset 0) (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base) (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0)) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (= (let ((.cse2 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse2 (+ (mod (select .cse2 8) 4294967296) 12))) 0) (<= (+ |ULTIMATE.start_aws_string_bytes_#res.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_hash_string_~item.offset ULTIMATE.start_aws_string_is_valid_~str.offset) (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12))) [2020-12-04 18:54:01,374 INFO L265 CegarLoopResult]: At program point L9944(lines 9944 9952) the Hoare annotation is: true [2020-12-04 18:54:01,375 INFO L265 CegarLoopResult]: At program point L266(line 266) the Hoare annotation is: true [2020-12-04 18:54:01,375 INFO L262 CegarLoopResult]: For program point L8904(line 8904) no Hoare annotation was computed. [2020-12-04 18:54:01,375 INFO L262 CegarLoopResult]: For program point L8871(line 8871) no Hoare annotation was computed. [2020-12-04 18:54:01,375 INFO L258 CegarLoopResult]: At program point L8838(lines 8838 8977) the Hoare annotation is: (let ((.cse2 (<= (+ ULTIMATE.start_aws_hash_string_~item.base 1) |#StackHeapBarrier|)) (.cse4 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse6 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_#res.base| 1) |#StackHeapBarrier|)) (.cse7 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse8 (<= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 1) |#StackHeapBarrier|)) (.cse13 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse17 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse0 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_hash_string_~item.base 0))) (.cse18 (= ULTIMATE.start_aws_string_bytes_~str.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse25 (not (= |ULTIMATE.start_aws_hash_string_~#c~8.base| |ULTIMATE.start_aws_string_bytes_#res.base|))) (.cse3 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse5 (= ULTIMATE.start_aws_hash_string_~str~3.offset 0)) (.cse19 (not (= ULTIMATE.start_aws_hash_string_~str~3.base 0))) (.cse20 (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_aws_hash_string_~str~3.base)) (.cse10 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse29 (<= (+ |ULTIMATE.start_aws_string_bytes_#res.base| 1) |#StackHeapBarrier|)) (.cse11 (<= (+ ULTIMATE.start_ensure_string_is_allocated_~str~0.base 1) |#StackHeapBarrier|)) (.cse30 (not (= ULTIMATE.start_aws_string_bytes_~str.base |ULTIMATE.start_aws_hash_string_~#b~6.base|))) (.cse31 (not (= ULTIMATE.start_hashlittle2_~pb.base ULTIMATE.start_aws_hash_string_~str~3.base))) (.cse12 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse14 (= ULTIMATE.start_aws_hash_string_~str~3.base |ULTIMATE.start_aws_string_bytes_#res.base|)) (.cse32 (not (= ULTIMATE.start_hashlittle2_~key.base ULTIMATE.start_hashlittle2_~pc.base))) (.cse15 (= ULTIMATE.start_aws_hash_string_~item.offset 0)) (.cse16 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse24 (= ULTIMATE.start_aws_hash_string_~str~3.base ULTIMATE.start_hashlittle2_~k~3.base))) (or (let ((.cse9 (+ ULTIMATE.start_aws_hash_string_~str~3.base 1))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_string_bytes_~str.offset ULTIMATE.start_aws_hash_string_~str~3.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 ULTIMATE.start_hashlittle2_~pc.base) .cse10 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#b~6.base|) (< .cse9 ULTIMATE.start_hashlittle2_~pb.base) .cse11 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_string_~#c~8.base|) .cse12 .cse13 .cse14 .cse15 .cse16 (= 1 |ULTIMATE.start_aws_string_is_valid_#res|) .cse17 (= ULTIMATE.start_aws_hash_string_~item.base ULTIMATE.start_aws_string_is_valid_~str.base) .cse18 .cse19 .cse20 (= (let ((.cse21 (select |#memory_int| ULTIMATE.start_aws_hash_string_~item.base))) (select .cse21 (+ (mod (select .cse21 8) 4294967296) 12))) 0) (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse22 (= |ULTIMATE.start_aws_string_bytes_#res.offset| (+ ULTIMATE.start_aws_hash_string_~str~3.offset 12)))) (let ((.cse27 (select |#memory_int| ULTIMATE.start_aws_string_is_valid_~str.base))) (let ((.cse28 (select .cse27 (+ ULTIMATE.start_aws_string_is_valid_~str.offset 8)))) (and .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= ULTIMATE.start_hashlittle2_~length (select (select |#memory_int| ULTIMATE.start_hashlittle2_~k~3.base) 8)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse25 .cse19 (let ((.cse26 (select .cse27 ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE))) (<= .cse26 (* 256 (div .cse26 256)))) .cse20 (<= .cse28 11) (<= 11 .cse28) .cse29 .cse30 .cse22 .cse31 .cse32))) (and .cse1 .cse0 .cse23 .cse18 .cse25 .cse3 .cse5 .cse19 .cse20 .cse10 .cse29 (= (select (select |#memory_int| ULTIMATE.start_hashlittle2_~key.base) 24) 0) .cse11 .cse30 .cse31 .cse12 .cse14 .cse32 .cse15 .cse16 (= (select (select |#memory_int| ULTIMATE.start_aws_hash_string_~str~3.base) (+ ULTIMATE.start_aws_hash_string_~str~3.offset 8)) 12) .cse24))) [2020-12-04 18:54:01,420 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,437 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,437 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,473 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,474 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,492 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,493 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,497 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,497 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:01,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 06:54:01 BoogieIcfgContainer [2020-12-04 18:54:01,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 18:54:01,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 18:54:01,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 18:54:01,504 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 18:54:01,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:49:59" (3/4) ... [2020-12-04 18:54:01,510 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-04 18:54:01,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 124 nodes and edges [2020-12-04 18:54:01,548 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2020-12-04 18:54:01,551 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2020-12-04 18:54:01,553 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-04 18:54:01,555 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-04 18:54:01,557 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-04 18:54:01,559 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-04 18:54:01,561 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-04 18:54:01,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1 [2020-12-04 18:54:01,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((str == 0 && \result == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && !(str == 0) [2020-12-04 18:54:01,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((str == 0 && \result == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && !(str == 0) [2020-12-04 18:54:01,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && \result == 0) && \result == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && !(\result == 0)) && !(str == 0) [2020-12-04 18:54:01,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result == 0) && \result == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && \result == 0) && !(str == 0) [2020-12-04 18:54:01,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result == 0) && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && item == str) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && str == 0) && 1 <= \result) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && \result <= 1) && \result == 0) && !(str == 0)) && item == str) && str == 0 [2020-12-04 18:54:01,599 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((\result == 0 && \result == 0) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str [2020-12-04 18:54:01,599 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((\result == 0 && \result == 0) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 [2020-12-04 18:54:01,600 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((\result == 0 && \result == 0) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && str == k) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 [2020-12-04 18:54:01,600 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 [2020-12-04 18:54:01,600 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 [2020-12-04 18:54:01,601 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((str == str && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && ((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(key == pb)) && (!(length == 12) || unknown-#memory_int-unknown[key][str + 8] == 12)) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)) && ((13 <= unknown-#memory_int-unknown[key][8] || unknown-#memory_int-unknown[key][8] <= 11) || unknown-#memory_int-unknown[key][24] == 0)) && !(key == pc)) || ((((((((unknown-#memory_int-unknown[str][8] <= 11 || unknown-#memory_int-unknown[str][24] == 0) || 13 <= unknown-#memory_int-unknown[str][8]) && \result == 0) && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)))) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && str == k) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12) || (((((((((((((((((((((((((((((!(item == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && ((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(key == pb)) && (!(length == 12) || unknown-#memory_int-unknown[key][str + 8] == 12)) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)) && ((13 <= unknown-#memory_int-unknown[key][8] || unknown-#memory_int-unknown[key][8] <= 11) || unknown-#memory_int-unknown[key][24] == 0)) && !(key == pc)) || ((((((((unknown-#memory_int-unknown[str][8] <= 11 || unknown-#memory_int-unknown[str][24] == 0) || 13 <= unknown-#memory_int-unknown[str][8]) && \result == 0) && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)))) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && !(str == 0)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc))) || (((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && !(c == \result)) && !(str == 0)) && key == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(pb == str)) && !(key == pc)) && unknown-#memory_int-unknown[str][str + 8] == 12) [2020-12-04 18:54:01,603 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 [2020-12-04 18:54:01,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && cond == 1) && !(\result == 0)) && \result == str + 12) || (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && !(str == 0)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc))) || (((((((((((((((((((((\result == 0 && \result == 0) && !(item == 0)) && str == str) && !(c == \result)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && !(str == 0)) && key == str) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(pb == str)) && \result == 0) && str == \result) && !(key == pc)) && item == 0) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && str == k) [2020-12-04 18:54:01,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && cond == 1) && !(\result == 0)) && \result == str + 12) || (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && !(str == 0)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc))) || (((((((((((((((((((((\result == 0 && \result == 0) && !(item == 0)) && str == str) && !(c == \result)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && !(str == 0)) && key == str) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(pb == str)) && \result == 0) && str == \result) && !(key == pc)) && item == 0) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && str == k) [2020-12-04 18:54:01,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 [2020-12-04 18:54:01,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result == 0 && str == str) && !(c == \result)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && key == str) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && 1 <= \result) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[str][24] == 0) && !(str == b)) && !(pb == str)) && \result <= 1) && str == \result) && !(key == pc)) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && str == k) || (((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && 1 == \result) && str == str) && item == str) && str == str) && key == str) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12)) || (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result <= 1) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && 1 <= \result) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc)) [2020-12-04 18:54:02,567 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-04 18:54:02,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 18:54:02,570 INFO L168 Benchmark]: Toolchain (without parser) took 258447.59 ms. Allocated memory was 60.8 MB in the beginning and 669.0 MB in the end (delta: 608.2 MB). Free memory was 34.1 MB in the beginning and 279.6 MB in the end (delta: -245.5 MB). Peak memory consumption was 464.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,570 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 46.1 MB. Free memory is still 25.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 18:54:02,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 5011.35 ms. Allocated memory was 60.8 MB in the beginning and 146.8 MB in the end (delta: 86.0 MB). Free memory was 33.9 MB in the beginning and 90.9 MB in the end (delta: -57.0 MB). Peak memory consumption was 104.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 301.80 ms. Allocated memory is still 146.8 MB. Free memory was 90.9 MB in the beginning and 78.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,572 INFO L168 Benchmark]: Boogie Preprocessor took 172.43 ms. Allocated memory is still 146.8 MB. Free memory was 78.3 MB in the beginning and 69.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,573 INFO L168 Benchmark]: RCFGBuilder took 9699.87 ms. Allocated memory was 146.8 MB in the beginning and 394.3 MB in the end (delta: 247.5 MB). Free memory was 69.9 MB in the beginning and 227.6 MB in the end (delta: -157.6 MB). Peak memory consumption was 223.0 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,574 INFO L168 Benchmark]: TraceAbstraction took 242186.97 ms. Allocated memory was 394.3 MB in the beginning and 669.0 MB in the end (delta: 274.7 MB). Free memory was 227.6 MB in the beginning and 268.1 MB in the end (delta: -40.6 MB). Peak memory consumption was 295.1 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,574 INFO L168 Benchmark]: Witness Printer took 1064.25 ms. Allocated memory is still 669.0 MB. Free memory was 268.1 MB in the beginning and 279.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 88.1 MB. Max. memory is 16.1 GB. [2020-12-04 18:54:02,577 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 46.1 MB. Free memory is still 25.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 5011.35 ms. Allocated memory was 60.8 MB in the beginning and 146.8 MB in the end (delta: 86.0 MB). Free memory was 33.9 MB in the beginning and 90.9 MB in the end (delta: -57.0 MB). Peak memory consumption was 104.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 301.80 ms. Allocated memory is still 146.8 MB. Free memory was 90.9 MB in the beginning and 78.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 172.43 ms. Allocated memory is still 146.8 MB. Free memory was 78.3 MB in the beginning and 69.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9699.87 ms. Allocated memory was 146.8 MB in the beginning and 394.3 MB in the end (delta: 247.5 MB). Free memory was 69.9 MB in the beginning and 227.6 MB in the end (delta: -157.6 MB). Peak memory consumption was 223.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 242186.97 ms. Allocated memory was 394.3 MB in the beginning and 669.0 MB in the end (delta: 274.7 MB). Free memory was 227.6 MB in the beginning and 268.1 MB in the end (delta: -40.6 MB). Peak memory consumption was 295.1 MB. Max. memory is 16.1 GB. * Witness Printer took 1064.25 ms. Allocated memory is still 669.0 MB. Free memory was 268.1 MB in the beginning and 279.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 88.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 10250]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((str == 0 && \result == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && !(str == 0) - InvariantResult [Line: 6291]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((\result == 0 && \result == 0) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 - InvariantResult [Line: 8856]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((\result == 0 && \result == 0) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && str == k) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 - InvariantResult [Line: 8890]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 - InvariantResult [Line: 9944]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((\result == 0 && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1 - InvariantResult [Line: 8868]: Loop Invariant [2020-12-04 18:54:02,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE Derived loop invariant: ((((((((((((((((((((((((((((((((str == str && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && ((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(key == pb)) && (!(length == 12) || unknown-#memory_int-unknown[key][str + 8] == 12)) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)) && ((13 <= unknown-#memory_int-unknown[key][8] || unknown-#memory_int-unknown[key][8] <= 11) || unknown-#memory_int-unknown[key][24] == 0)) && !(key == pc)) || ((((((((unknown-#memory_int-unknown[str][8] <= 11 || unknown-#memory_int-unknown[str][24] == 0) || 13 <= unknown-#memory_int-unknown[str][8]) && \result == 0) && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)))) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && str == k) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12) || (((((((((((((((((((((((((((((!(item == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && ((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(key == pb)) && (!(length == 12) || unknown-#memory_int-unknown[key][str + 8] == 12)) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)) && ((13 <= unknown-#memory_int-unknown[key][8] || unknown-#memory_int-unknown[key][8] <= 11) || unknown-#memory_int-unknown[key][24] == 0)) && !(key == pc)) || ((((((((unknown-#memory_int-unknown[str][8] <= 11 || unknown-#memory_int-unknown[str][24] == 0) || 13 <= unknown-#memory_int-unknown[str][8]) && \result == 0) && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)))) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && !(str == 0)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc))) || (((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && ((unknown-#memory_int-unknown[item][24] == 0 || unknown-#memory_int-unknown[item][8] <= 11) || 13 <= unknown-#memory_int-unknown[item][8])) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && ((unknown-#memory_int-unknown[\result][8] <= 11 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][24] == 0)) && ((unknown-#memory_int-unknown[\result][24] == 0 || 13 <= unknown-#memory_int-unknown[\result][8]) || unknown-#memory_int-unknown[\result][8] <= 11)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && !(c == \result)) && !(str == 0)) && key == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(pb == str)) && !(key == pc)) && unknown-#memory_int-unknown[str][str + 8] == 12) - InvariantResult [Line: 6301]: Loop Invariant [2020-12-04 18:54:02,611 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,613 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,618 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE Derived loop invariant: (((((((((((((((((((((\result == 0 && str == str) && !(c == \result)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && key == str) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && 1 <= \result) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[str][24] == 0) && !(str == b)) && !(pb == str)) && \result <= 1) && str == \result) && !(key == pc)) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && str == k) || (((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && str == 0) && 1 == \result) && str == str) && item == str) && str == str) && key == str) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12)) || (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result <= 1) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && 1 <= \result) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc)) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6867]: Loop Invariant Derived loop invariant: (((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && \result == 0) && \result == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && !(\result == 0)) && !(str == 0) - InvariantResult [Line: 6301]: Loop Invariant Derived loop invariant: (((((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result == 0) && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && item == str) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && str == 0) && 1 <= \result) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && \result <= 1) && \result == 0) && !(str == 0)) && item == str) && str == 0 - InvariantResult [Line: 8956]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 - InvariantResult [Line: 6861]: Loop Invariant Derived loop invariant: (((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result == 0) && \result == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && \result == 0) && !(str == 0) - InvariantResult [Line: 8838]: Loop Invariant [2020-12-04 18:54:02,628 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,628 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE Derived loop invariant: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && cond == 1) && !(\result == 0)) && \result == str + 12) || (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && !(str == 0)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc))) || (((((((((((((((((((((\result == 0 && \result == 0) && !(item == 0)) && str == str) && !(c == \result)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && !(str == 0)) && key == str) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(pb == str)) && \result == 0) && str == \result) && !(key == pc)) && item == 0) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && str == k) - InvariantResult [Line: 8902]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 - InvariantResult [Line: 8936]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 < pc) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && !(str == 0)) && \result == 0) && str == \result) && item == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str) && \result == str + 12 - InvariantResult [Line: 6301]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\result == 0 && \result == 0) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == 0) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && 1 == \result) && str == str) && item == str) && str == str) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && !(\result == 0)) && cond == 1) && item == str - InvariantResult [Line: 9951]: Loop Invariant [2020-12-04 18:54:02,639 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,639 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE [2020-12-04 18:54:02,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE Derived loop invariant: (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && str == str) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str + 1 < pc) && str == 0) && unknown-#StackHeapBarrier-unknown < b) && str + 1 < pb) && str + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < c) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && 1 == \result) && str == str) && item == str) && str == str) && !(str == 0)) && key == str) && unknown-#memory_int-unknown[item][unknown-#memory_int-unknown[item][8] % 4294967296 + 12] == 0) && cond == 1) && !(\result == 0)) && \result == str + 12) || (((((((((((((((((((((((((((((((\result == 0 && \result == 0) && item + 1 <= unknown-#StackHeapBarrier-unknown) && !(item == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && length == unknown-#memory_int-unknown[k][8]) && \result == 0) && !(str == 0)) && str == \result) && item == 0) && str == 0) && str == k) && str == str) && str == str) && !(c == \result)) && !(str == 0)) && unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] <= 256 * (unknown-#memory_int-unknown[str][~aws_common_error~0~AWS_ERROR_CLOCK_FAILURE] / 256)) && key == str) && unknown-#memory_int-unknown[str][str + 8] <= 11) && 11 <= unknown-#memory_int-unknown[str][str + 8]) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(\result == 0)) && !(pb == str)) && !(key == pc))) || (((((((((((((((((((((\result == 0 && \result == 0) && !(item == 0)) && str == str) && !(c == \result)) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && str == 0) && !(str == 0)) && key == str) && str == 0) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[key][24] == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && !(str == b)) && !(pb == str)) && \result == 0) && str == \result) && !(key == pc)) && item == 0) && str == 0) && unknown-#memory_int-unknown[str][str + 8] == 12) && str == k) - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: (((((str == 0 && \result == 0) && str + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && cond == 1) && !(str == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 200.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 163.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 41.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 772 SDtfs, 11543 SDslu, 2721 SDs, 0 SdLazy, 4041 SolverSat, 819 SolverUnsat, 41 SolverUnknown, 0 SolverNotchecked, 97.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 69.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=4, 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, 7 MinimizatonAttempts, 184 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 74 NumberOfFragments, 3394 HoareAnnotationTreeSize, 20 FomulaSimplifications, 25839 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 20 FomulaSimplificationsInter, 26036 FormulaSimplificationTreeSizeReductionInter, 40.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 17.2s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 210217 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2373 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...