./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.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 e96d8d92db1667c6f6142560a7fad2417327f7e06eb532366f9ad7d4ddd7d1f5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:09:59,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:09:59,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:09:59,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:09:59,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:09:59,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:09:59,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:09:59,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:09:59,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:09:59,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:09:59,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:09:59,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:09:59,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:09:59,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:09:59,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:09:59,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:09:59,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:09:59,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:09:59,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:09:59,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:09:59,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:09:59,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:09:59,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:09:59,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:09:59,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:09:59,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:09:59,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:09:59,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:09:59,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:09:59,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:09:59,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:09:59,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:09:59,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:09:59,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:09:59,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:09:59,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:09:59,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:09:59,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:09:59,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:09:59,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:09:59,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:09:59,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:09:59,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:09:59,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:09:59,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:09:59,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:09:59,592 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:09:59,592 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:09:59,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:09:59,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:09:59,592 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:09:59,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:09:59,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:09:59,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:09:59,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:09:59,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:09:59,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:09:59,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:09:59,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:09:59,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:09:59,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:09:59,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:09:59,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:09:59,596 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:09:59,597 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:09:59,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:09:59,597 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 -> e96d8d92db1667c6f6142560a7fad2417327f7e06eb532366f9ad7d4ddd7d1f5 [2022-02-20 21:09:59,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:09:59,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:09:59,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:09:59,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:09:59,785 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:09:59,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2022-02-20 21:09:59,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260625c67/93cc22e0c9df4a769e8cbef087e43e80/FLAG0d0c739f5 [2022-02-20 21:10:00,398 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:10:00,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2022-02-20 21:10:00,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260625c67/93cc22e0c9df4a769e8cbef087e43e80/FLAG0d0c739f5 [2022-02-20 21:10:00,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260625c67/93cc22e0c9df4a769e8cbef087e43e80 [2022-02-20 21:10:00,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:10:00,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:10:00,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:00,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:10:00,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:10:00,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:00" (1/1) ... [2022-02-20 21:10:00,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e75e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:00, skipping insertion in model container [2022-02-20 21:10:00,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:00" (1/1) ... [2022-02-20 21:10:00,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:10:00,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:10:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4500,4513] [2022-02-20 21:10:01,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4560,4573] [2022-02-20 21:10:01,587 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,589 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,589 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,590 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,591 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,611 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,612 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,613 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,614 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,615 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,615 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,616 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,616 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,801 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:01,802 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:01,803 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:01,803 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:01,804 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:01,804 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:01,805 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:01,805 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:01,806 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:01,806 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:01,889 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:01,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:01,913 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:10:01,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4500,4513] [2022-02-20 21:10:01,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i[4560,4573] [2022-02-20 21:10:01,948 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,948 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,949 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,949 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,949 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,954 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,955 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,956 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,956 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,957 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,957 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,957 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:01,958 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:02,034 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:02,035 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:02,035 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:02,036 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:02,042 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:02,043 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:02,043 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:02,043 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:02,044 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:02,044 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:02,070 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:02,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:02,217 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:10:02,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02 WrapperNode [2022-02-20 21:10:02,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:02,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:02,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:10:02,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:10:02,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,312 INFO L137 Inliner]: procedures = 679, calls = 1032, calls flagged for inlining = 48, calls inlined = 3, statements flattened = 29 [2022-02-20 21:10:02,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:02,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:10:02,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:10:02,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:10:02,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:10:02,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:10:02,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:10:02,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:10:02,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (1/1) ... [2022-02-20 21:10:02,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:02,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:02,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:10:02,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:10:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_reset [2022-02-20 21:10:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_reset [2022-02-20 21:10:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-02-20 21:10:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-02-20 21:10:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:10:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:10:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:10:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:10:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:10:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:10:02,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:10:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:10:02,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:10:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:10:02,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:10:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:10:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:10:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:10:02,615 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:10:02,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:10:02,707 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:10:02,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:10:02,711 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:10:02,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:02 BoogieIcfgContainer [2022-02-20 21:10:02,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:10:02,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:10:02,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:10:02,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:10:02,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:10:00" (1/3) ... [2022-02-20 21:10:02,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303b8481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:02, skipping insertion in model container [2022-02-20 21:10:02,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:02" (2/3) ... [2022-02-20 21:10:02,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303b8481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:02, skipping insertion in model container [2022-02-20 21:10:02,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:02" (3/3) ... [2022-02-20 21:10:02,717 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_node_reset_harness-1.i [2022-02-20 21:10:02,720 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:10:02,720 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:10:02,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:10:02,751 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:10:02,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:10:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 21:10:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 21:10:02,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:02,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:02,775 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -527313499, now seen corresponding path program 1 times [2022-02-20 21:10:02,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:02,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261541521] [2022-02-20 21:10:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:02,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#true} ~cond := #in~cond; {44#true} is VALID [2022-02-20 21:10:03,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume 0 == ~cond % 256;assume false; {45#false} is VALID [2022-02-20 21:10:03,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#false} assume true; {45#false} is VALID [2022-02-20 21:10:03,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#false} {44#true} #84#return; {45#false} is VALID [2022-02-20 21:10:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:10:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {44#true} is VALID [2022-02-20 21:10:03,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {44#true} is VALID [2022-02-20 21:10:03,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {44#true} is VALID [2022-02-20 21:10:03,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#true} assume true; {44#true} is VALID [2022-02-20 21:10:03,082 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44#true} {45#false} #88#return; {45#false} is VALID [2022-02-20 21:10:03,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {44#true} is VALID [2022-02-20 21:10:03,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {44#true} is VALID [2022-02-20 21:10:03,085 INFO L272 TraceCheckUtils]: 2: Hoare triple {44#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {44#true} is VALID [2022-02-20 21:10:03,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {44#true} is VALID [2022-02-20 21:10:03,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {44#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {44#true} is VALID [2022-02-20 21:10:03,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {44#true} ~cond := #in~cond; {44#true} is VALID [2022-02-20 21:10:03,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#true} assume 0 == ~cond % 256;assume false; {45#false} is VALID [2022-02-20 21:10:03,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#false} assume true; {45#false} is VALID [2022-02-20 21:10:03,088 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {45#false} {44#true} #84#return; {45#false} is VALID [2022-02-20 21:10:03,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {45#false} assume !true; {45#false} is VALID [2022-02-20 21:10:03,090 INFO L272 TraceCheckUtils]: 10: Hoare triple {45#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {44#true} is VALID [2022-02-20 21:10:03,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {44#true} is VALID [2022-02-20 21:10:03,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {44#true} is VALID [2022-02-20 21:10:03,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {44#true} is VALID [2022-02-20 21:10:03,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#true} assume true; {44#true} is VALID [2022-02-20 21:10:03,094 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#true} {45#false} #88#return; {45#false} is VALID [2022-02-20 21:10:03,094 INFO L272 TraceCheckUtils]: 16: Hoare triple {45#false} call __VERIFIER_assert(#t~ret293); {45#false} is VALID [2022-02-20 21:10:03,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2022-02-20 21:10:03,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {45#false} assume 0 == ~cond % 256; {45#false} is VALID [2022-02-20 21:10:03,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {45#false} assume !false; {45#false} is VALID [2022-02-20 21:10:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:03,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:03,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261541521] [2022-02-20 21:10:03,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261541521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:03,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:03,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:10:03,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815393780] [2022-02-20 21:10:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:03,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 21:10:03,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:03,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:10:03,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:03,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:10:03,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:10:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:10:03,157 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:10:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:03,217 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-02-20 21:10:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:10:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 21:10:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:10:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2022-02-20 21:10:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:10:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2022-02-20 21:10:03,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 96 transitions. [2022-02-20 21:10:03,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:03,338 INFO L225 Difference]: With dead ends: 75 [2022-02-20 21:10:03,338 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 21:10:03,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:10:03,342 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:03,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 21:10:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 21:10:03,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:03,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,362 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,362 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:03,365 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 21:10:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 21:10:03,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:03,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:03,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 21:10:03,367 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 21:10:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:03,369 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 21:10:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 21:10:03,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:03,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:03,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:03,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-02-20 21:10:03,373 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2022-02-20 21:10:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:03,373 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-02-20 21:10:03,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:10:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 21:10:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 21:10:03,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:03,374 INFO L514 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] [2022-02-20 21:10:03,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:10:03,375 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash 74286250, now seen corresponding path program 1 times [2022-02-20 21:10:03,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:03,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209929256] [2022-02-20 21:10:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#true} ~cond := #in~cond; {280#true} is VALID [2022-02-20 21:10:03,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume !(0 == ~cond % 256); {280#true} is VALID [2022-02-20 21:10:03,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {280#true} assume true; {280#true} is VALID [2022-02-20 21:10:03,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {280#true} {280#true} #84#return; {280#true} is VALID [2022-02-20 21:10:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {296#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:03,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} is VALID [2022-02-20 21:10:03,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} is VALID [2022-02-20 21:10:03,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} {280#true} #86#return; {281#false} is VALID [2022-02-20 21:10:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {280#true} is VALID [2022-02-20 21:10:03,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {280#true} is VALID [2022-02-20 21:10:03,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {280#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {280#true} is VALID [2022-02-20 21:10:03,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {280#true} assume true; {280#true} is VALID [2022-02-20 21:10:03,582 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {280#true} {281#false} #88#return; {281#false} is VALID [2022-02-20 21:10:03,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {280#true} is VALID [2022-02-20 21:10:03,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {280#true} is VALID [2022-02-20 21:10:03,583 INFO L272 TraceCheckUtils]: 2: Hoare triple {280#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {280#true} is VALID [2022-02-20 21:10:03,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {280#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {280#true} is VALID [2022-02-20 21:10:03,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {280#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {280#true} is VALID [2022-02-20 21:10:03,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {280#true} ~cond := #in~cond; {280#true} is VALID [2022-02-20 21:10:03,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#true} assume !(0 == ~cond % 256); {280#true} is VALID [2022-02-20 21:10:03,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#true} assume true; {280#true} is VALID [2022-02-20 21:10:03,584 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {280#true} {280#true} #84#return; {280#true} is VALID [2022-02-20 21:10:03,585 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {295#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:03,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {295#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {296#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:03,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} is VALID [2022-02-20 21:10:03,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} is VALID [2022-02-20 21:10:03,587 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {297#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 18446744073709551616)))} {280#true} #86#return; {281#false} is VALID [2022-02-20 21:10:03,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {281#false} havoc #t~memset~res292.base, #t~memset~res292.offset; {281#false} is VALID [2022-02-20 21:10:03,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {281#false} goto; {281#false} is VALID [2022-02-20 21:10:03,588 INFO L272 TraceCheckUtils]: 16: Hoare triple {281#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {280#true} is VALID [2022-02-20 21:10:03,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {280#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {280#true} is VALID [2022-02-20 21:10:03,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {280#true} is VALID [2022-02-20 21:10:03,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {280#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {280#true} is VALID [2022-02-20 21:10:03,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {280#true} assume true; {280#true} is VALID [2022-02-20 21:10:03,588 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {280#true} {281#false} #88#return; {281#false} is VALID [2022-02-20 21:10:03,589 INFO L272 TraceCheckUtils]: 22: Hoare triple {281#false} call __VERIFIER_assert(#t~ret293); {281#false} is VALID [2022-02-20 21:10:03,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {281#false} ~cond := #in~cond; {281#false} is VALID [2022-02-20 21:10:03,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {281#false} assume 0 == ~cond % 256; {281#false} is VALID [2022-02-20 21:10:03,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {281#false} assume !false; {281#false} is VALID [2022-02-20 21:10:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:03,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:03,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209929256] [2022-02-20 21:10:03,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209929256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:03,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:03,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:10:03,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665052119] [2022-02-20 21:10:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:03,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-20 21:10:03,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:03,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:10:03,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:03,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:10:03,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:10:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:10:03,617 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:10:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:03,840 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-02-20 21:10:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:10:03,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-02-20 21:10:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:10:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-02-20 21:10:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:10:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-02-20 21:10:03,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-02-20 21:10:03,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:03,909 INFO L225 Difference]: With dead ends: 61 [2022-02-20 21:10:03,909 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 21:10:03,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:10:03,910 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:03,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:10:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 21:10:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 21:10:03,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:03,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,919 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,920 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:03,923 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 21:10:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 21:10:03,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:03,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:03,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 21:10:03,924 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 21:10:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:03,929 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 21:10:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 21:10:03,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:03,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:03,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:03,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-02-20 21:10:03,935 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2022-02-20 21:10:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:03,936 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-02-20 21:10:03,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:10:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 21:10:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 21:10:03,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:03,938 INFO L514 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] [2022-02-20 21:10:03,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:10:03,938 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2047649194, now seen corresponding path program 1 times [2022-02-20 21:10:03,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:03,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658833717] [2022-02-20 21:10:03,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:03,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:04,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-02-20 21:10:04,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume !(0 == ~cond % 256); {513#true} is VALID [2022-02-20 21:10:04,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#true} assume true; {513#true} is VALID [2022-02-20 21:10:04,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {513#true} {513#true} #84#return; {513#true} is VALID [2022-02-20 21:10:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:04,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {530#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:04,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {531#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 1)))} is VALID [2022-02-20 21:10:04,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 1)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:04,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:04,116 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} {513#true} #86#return; {514#false} is VALID [2022-02-20 21:10:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 21:10:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:04,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {513#true} is VALID [2022-02-20 21:10:04,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {513#true} is VALID [2022-02-20 21:10:04,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {513#true} is VALID [2022-02-20 21:10:04,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {513#true} assume true; {513#true} is VALID [2022-02-20 21:10:04,133 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {513#true} {514#false} #88#return; {514#false} is VALID [2022-02-20 21:10:04,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {513#true} is VALID [2022-02-20 21:10:04,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {513#true} is VALID [2022-02-20 21:10:04,133 INFO L272 TraceCheckUtils]: 2: Hoare triple {513#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {513#true} is VALID [2022-02-20 21:10:04,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {513#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {513#true} is VALID [2022-02-20 21:10:04,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {513#true} is VALID [2022-02-20 21:10:04,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-02-20 21:10:04,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {513#true} assume !(0 == ~cond % 256); {513#true} is VALID [2022-02-20 21:10:04,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} assume true; {513#true} is VALID [2022-02-20 21:10:04,134 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {513#true} {513#true} #84#return; {513#true} is VALID [2022-02-20 21:10:04,135 INFO L272 TraceCheckUtils]: 9: Hoare triple {513#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {529#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:04,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {529#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {530#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:04,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {531#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 1)))} is VALID [2022-02-20 21:10:04,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {531#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 1)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:04,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:04,139 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {532#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} {513#true} #86#return; {514#false} is VALID [2022-02-20 21:10:04,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {514#false} havoc #t~memset~res292.base, #t~memset~res292.offset; {514#false} is VALID [2022-02-20 21:10:04,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#false} goto; {514#false} is VALID [2022-02-20 21:10:04,139 INFO L272 TraceCheckUtils]: 17: Hoare triple {514#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {513#true} is VALID [2022-02-20 21:10:04,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {513#true} is VALID [2022-02-20 21:10:04,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {513#true} is VALID [2022-02-20 21:10:04,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {513#true} is VALID [2022-02-20 21:10:04,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#true} assume true; {513#true} is VALID [2022-02-20 21:10:04,141 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {513#true} {514#false} #88#return; {514#false} is VALID [2022-02-20 21:10:04,141 INFO L272 TraceCheckUtils]: 23: Hoare triple {514#false} call __VERIFIER_assert(#t~ret293); {514#false} is VALID [2022-02-20 21:10:04,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {514#false} ~cond := #in~cond; {514#false} is VALID [2022-02-20 21:10:04,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {514#false} assume 0 == ~cond % 256; {514#false} is VALID [2022-02-20 21:10:04,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-02-20 21:10:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:04,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:04,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658833717] [2022-02-20 21:10:04,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658833717] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:04,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530228847] [2022-02-20 21:10:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:04,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:04,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:10:04,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:10:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:04,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 21:10:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:04,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:04,834 INFO L390 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 0 case distinctions, treesize of input 16 treesize of output 12 [2022-02-20 21:10:07,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {513#true} is VALID [2022-02-20 21:10:07,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {513#true} is VALID [2022-02-20 21:10:07,769 INFO L272 TraceCheckUtils]: 2: Hoare triple {513#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {513#true} is VALID [2022-02-20 21:10:07,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {513#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {513#true} is VALID [2022-02-20 21:10:07,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {513#true} is VALID [2022-02-20 21:10:07,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-02-20 21:10:07,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {513#true} assume !(0 == ~cond % 256); {513#true} is VALID [2022-02-20 21:10:07,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} assume true; {513#true} is VALID [2022-02-20 21:10:07,771 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {513#true} {513#true} #84#return; {513#true} is VALID [2022-02-20 21:10:07,772 INFO L272 TraceCheckUtils]: 9: Hoare triple {513#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {513#true} is VALID [2022-02-20 21:10:07,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {513#true} #t~loopctr676 := 0; {530#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:07,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {569#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) |#Ultimate.C_memset_#value|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) |#Ultimate.C_memset_#value|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {569#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) |#Ultimate.C_memset_#value|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) |#Ultimate.C_memset_#value|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {569#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) |#Ultimate.C_memset_#value|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,790 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {569#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) |#Ultimate.C_memset_#value|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} {513#true} #86#return; {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} havoc #t~memset~res292.base, #t~memset~res292.offset; {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} goto; {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {589#(exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} is VALID [2022-02-20 21:10:07,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {589#(exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {593#(and (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} is VALID [2022-02-20 21:10:07,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {593#(and (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {597#(and (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|)) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))))} is VALID [2022-02-20 21:10:07,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {597#(and (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|)) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {601#(and (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))))} is VALID [2022-02-20 21:10:07,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#(and (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))))} assume true; {601#(and (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))))} is VALID [2022-02-20 21:10:07,823 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {601#(and (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (exists ((v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_1) (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_1 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) 0) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0))))} {579#(exists ((|aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int) (|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| Int)) (and (<= 0 (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|)) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65| 18446744073709551615) (= 0 (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|))) (<= (+ (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_5_65|) |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_5_65|) 0)))} #88#return; {514#false} is VALID [2022-02-20 21:10:07,823 INFO L272 TraceCheckUtils]: 23: Hoare triple {514#false} call __VERIFIER_assert(#t~ret293); {514#false} is VALID [2022-02-20 21:10:07,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {514#false} ~cond := #in~cond; {514#false} is VALID [2022-02-20 21:10:07,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {514#false} assume 0 == ~cond % 256; {514#false} is VALID [2022-02-20 21:10:07,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-02-20 21:10:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:07,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:10:08,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-02-20 21:10:08,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-02-20 21:10:08,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-02-20 21:10:08,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {514#false} assume 0 == ~cond % 256; {514#false} is VALID [2022-02-20 21:10:08,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {514#false} ~cond := #in~cond; {514#false} is VALID [2022-02-20 21:10:08,674 INFO L272 TraceCheckUtils]: 23: Hoare triple {514#false} call __VERIFIER_assert(#t~ret293); {514#false} is VALID [2022-02-20 21:10:08,675 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {636#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} #88#return; {514#false} is VALID [2022-02-20 21:10:08,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {636#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} assume true; {636#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} is VALID [2022-02-20 21:10:08,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(or (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {636#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} is VALID [2022-02-20 21:10:08,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {647#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256) 1)) (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {643#(or (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} is VALID [2022-02-20 21:10:08,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {647#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256) 1)) (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is VALID [2022-02-20 21:10:08,680 INFO L272 TraceCheckUtils]: 17: Hoare triple {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {513#true} is VALID [2022-02-20 21:10:08,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} goto; {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:08,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} havoc #t~memset~res292.base, #t~memset~res292.offset; {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:08,681 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {663#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} {513#true} #86#return; {632#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:08,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {663#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:08,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {663#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {663#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:08,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(or (<= 18446744073709551615 (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (= |#Ultimate.C_memset_#ptr.offset| (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|)) (not (= |#Ultimate.C_memset_#value| 0)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {663#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:08,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {513#true} #t~loopctr676 := 0; {673#(or (<= 18446744073709551615 (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (= |#Ultimate.C_memset_#ptr.offset| (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|)) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:08,684 INFO L272 TraceCheckUtils]: 9: Hoare triple {513#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {513#true} is VALID [2022-02-20 21:10:08,684 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {513#true} {513#true} #84#return; {513#true} is VALID [2022-02-20 21:10:08,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} assume true; {513#true} is VALID [2022-02-20 21:10:08,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {513#true} assume !(0 == ~cond % 256); {513#true} is VALID [2022-02-20 21:10:08,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-02-20 21:10:08,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {513#true} is VALID [2022-02-20 21:10:08,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {513#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {513#true} is VALID [2022-02-20 21:10:08,703 INFO L272 TraceCheckUtils]: 2: Hoare triple {513#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {513#true} is VALID [2022-02-20 21:10:08,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {513#true} is VALID [2022-02-20 21:10:08,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {513#true} is VALID [2022-02-20 21:10:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:08,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530228847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:10:08,703 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:10:08,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2022-02-20 21:10:08,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549096563] [2022-02-20 21:10:08,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:10:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 27 [2022-02-20 21:10:08,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:08,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:08,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:08,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 21:10:08,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 21:10:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-20 21:10:08,807 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:09,548 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-02-20 21:10:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:10:09,548 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 27 [2022-02-20 21:10:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-02-20 21:10:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-02-20 21:10:09,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-02-20 21:10:09,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:09,639 INFO L225 Difference]: With dead ends: 70 [2022-02-20 21:10:09,640 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 21:10:09,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-02-20 21:10:09,643 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:09,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2022-02-20 21:10:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 21:10:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-02-20 21:10:09,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:09,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:09,656 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:09,657 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:09,661 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 21:10:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 21:10:09,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:09,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:09,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 21:10:09,662 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 21:10:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:09,665 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-20 21:10:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-20 21:10:09,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:09,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:09,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:09,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-02-20 21:10:09,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2022-02-20 21:10:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:09,670 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-02-20 21:10:09,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-02-20 21:10:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 21:10:09,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:09,671 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:09,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:10:09,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:09,875 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 891828778, now seen corresponding path program 2 times [2022-02-20 21:10:09,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:09,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663710231] [2022-02-20 21:10:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:09,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:09,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} ~cond := #in~cond; {956#true} is VALID [2022-02-20 21:10:09,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume !(0 == ~cond % 256); {956#true} is VALID [2022-02-20 21:10:09,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2022-02-20 21:10:09,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #84#return; {956#true} is VALID [2022-02-20 21:10:09,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:10,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {973#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {974#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:10,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {974#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {975#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:10,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {975#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {976#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 2)))} is VALID [2022-02-20 21:10:10,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {976#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 2)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:10,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:10,074 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} {956#true} #86#return; {957#false} is VALID [2022-02-20 21:10:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:10:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:10,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {956#true} is VALID [2022-02-20 21:10:10,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {956#true} is VALID [2022-02-20 21:10:10,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {956#true} is VALID [2022-02-20 21:10:10,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {956#true} assume true; {956#true} is VALID [2022-02-20 21:10:10,084 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {956#true} {957#false} #88#return; {957#false} is VALID [2022-02-20 21:10:10,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {956#true} is VALID [2022-02-20 21:10:10,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {956#true} is VALID [2022-02-20 21:10:10,085 INFO L272 TraceCheckUtils]: 2: Hoare triple {956#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {956#true} is VALID [2022-02-20 21:10:10,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {956#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {956#true} is VALID [2022-02-20 21:10:10,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {956#true} is VALID [2022-02-20 21:10:10,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~cond := #in~cond; {956#true} is VALID [2022-02-20 21:10:10,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume !(0 == ~cond % 256); {956#true} is VALID [2022-02-20 21:10:10,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#true} assume true; {956#true} is VALID [2022-02-20 21:10:10,086 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {956#true} {956#true} #84#return; {956#true} is VALID [2022-02-20 21:10:10,087 INFO L272 TraceCheckUtils]: 9: Hoare triple {956#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {973#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:10,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {974#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:10,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {974#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {975#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:10,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {976#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 2)))} is VALID [2022-02-20 21:10:10,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {976#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 2)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:10,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:10,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {977#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} {956#true} #86#return; {957#false} is VALID [2022-02-20 21:10:10,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#false} havoc #t~memset~res292.base, #t~memset~res292.offset; {957#false} is VALID [2022-02-20 21:10:10,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {957#false} goto; {957#false} is VALID [2022-02-20 21:10:10,091 INFO L272 TraceCheckUtils]: 18: Hoare triple {957#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {956#true} is VALID [2022-02-20 21:10:10,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {956#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {956#true} is VALID [2022-02-20 21:10:10,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {956#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {956#true} is VALID [2022-02-20 21:10:10,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {956#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {956#true} is VALID [2022-02-20 21:10:10,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {956#true} assume true; {956#true} is VALID [2022-02-20 21:10:10,094 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {956#true} {957#false} #88#return; {957#false} is VALID [2022-02-20 21:10:10,094 INFO L272 TraceCheckUtils]: 24: Hoare triple {957#false} call __VERIFIER_assert(#t~ret293); {957#false} is VALID [2022-02-20 21:10:10,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {957#false} ~cond := #in~cond; {957#false} is VALID [2022-02-20 21:10:10,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {957#false} assume 0 == ~cond % 256; {957#false} is VALID [2022-02-20 21:10:10,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-02-20 21:10:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:10,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:10,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663710231] [2022-02-20 21:10:10,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663710231] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:10,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181559848] [2022-02-20 21:10:10,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 21:10:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:10,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:10:10,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 21:10:10,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 21:10:10,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 21:10:10,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 21:10:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:10,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:10,239 INFO L390 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-02-20 21:10:10,532 INFO L356 Elim1Store]: treesize reduction 47, result has 21.7 percent of original size [2022-02-20 21:10:10,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-02-20 21:10:13,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {956#true} is VALID [2022-02-20 21:10:13,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {956#true} is VALID [2022-02-20 21:10:13,630 INFO L272 TraceCheckUtils]: 2: Hoare triple {956#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {956#true} is VALID [2022-02-20 21:10:13,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {956#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {956#true} is VALID [2022-02-20 21:10:13,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {956#true} is VALID [2022-02-20 21:10:13,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~cond := #in~cond; {956#true} is VALID [2022-02-20 21:10:13,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume !(0 == ~cond % 256); {956#true} is VALID [2022-02-20 21:10:13,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#true} assume true; {956#true} is VALID [2022-02-20 21:10:13,631 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {956#true} {956#true} #84#return; {956#true} is VALID [2022-02-20 21:10:13,631 INFO L272 TraceCheckUtils]: 9: Hoare triple {956#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {956#true} is VALID [2022-02-20 21:10:13,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {956#true} #t~loopctr676 := 0; {974#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:13,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {974#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1014#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 1 |#Ultimate.C_memset_#t~loopctr676|) (< (mod (+ 18446744073709551615 |#Ultimate.C_memset_#t~loopctr676|) 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616)))} is VALID [2022-02-20 21:10:13,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {1014#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 1 |#Ultimate.C_memset_#t~loopctr676|) (< (mod (+ 18446744073709551615 |#Ultimate.C_memset_#t~loopctr676|) 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1018#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (mod |#Ultimate.C_memset_#amount| 18446744073709551616)) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616)))) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {1018#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (mod |#Ultimate.C_memset_#amount| 18446744073709551616)) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616)))) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1018#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (mod |#Ultimate.C_memset_#amount| 18446744073709551616)) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616)))) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {1018#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (mod |#Ultimate.C_memset_#amount| 18446744073709551616)) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616)))) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1018#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (mod |#Ultimate.C_memset_#amount| 18446744073709551616)) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616)))) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,655 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1018#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (mod |#Ultimate.C_memset_#amount| 18446744073709551616)) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| |#Ultimate.C_memset_#ptr.offset| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616)))) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} {956#true} #86#return; {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} havoc #t~memset~res292.base, #t~memset~res292.offset; {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} goto; {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,668 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {1038#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} is VALID [2022-02-20 21:10:13,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1042#(and (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} is VALID [2022-02-20 21:10:13,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#(and (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1046#(and (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|)) (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))))} is VALID [2022-02-20 21:10:13,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {1046#(and (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|)) (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {1050#(and (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is VALID [2022-02-20 21:10:13,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {1050#(and (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} assume true; {1050#(and (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is VALID [2022-02-20 21:10:13,841 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1050#(and (exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6 Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_6) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_6)) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} {1028#(exists ((|aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int) (|aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91| Int)) (and (< |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| 15) (<= 18446744073709551616 (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|))) (<= (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|)) 18446744073709551616) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91| aws_linked_list_node_reset_~node.offset (* 18446744073709551616 |aux_div_v_#Ultimate.C_memset_#t~loopctr676_13_91|) (- 18446744073709551616))) 0) (<= 0 |aux_mod_v_#Ultimate.C_memset_#t~loopctr676_13_91|)))} #88#return; {957#false} is VALID [2022-02-20 21:10:13,842 INFO L272 TraceCheckUtils]: 24: Hoare triple {957#false} call __VERIFIER_assert(#t~ret293); {957#false} is VALID [2022-02-20 21:10:13,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {957#false} ~cond := #in~cond; {957#false} is VALID [2022-02-20 21:10:13,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {957#false} assume 0 == ~cond % 256; {957#false} is VALID [2022-02-20 21:10:13,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-02-20 21:10:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:13,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:10:14,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-02-20 21:10:14,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-02-20 21:10:14,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2022-02-20 21:10:15,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-02-20 21:10:15,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {957#false} assume 0 == ~cond % 256; {957#false} is VALID [2022-02-20 21:10:15,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {957#false} ~cond := #in~cond; {957#false} is VALID [2022-02-20 21:10:15,133 INFO L272 TraceCheckUtils]: 24: Hoare triple {957#false} call __VERIFIER_assert(#t~ret293); {957#false} is VALID [2022-02-20 21:10:15,138 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1085#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} #88#return; {957#false} is VALID [2022-02-20 21:10:15,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {1085#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} assume true; {1085#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} is VALID [2022-02-20 21:10:15,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {1092#(or (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {1085#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} is VALID [2022-02-20 21:10:15,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {1096#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807))) (or (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807) (<= (div (+ (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256) (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256)))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1092#(or (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} is VALID [2022-02-20 21:10:15,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {956#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1096#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807))) (or (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807) (<= (div (+ (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256) (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256)))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is VALID [2022-02-20 21:10:15,144 INFO L272 TraceCheckUtils]: 18: Hoare triple {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {956#true} is VALID [2022-02-20 21:10:15,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} goto; {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:15,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} havoc #t~memset~res292.base, #t~memset~res292.offset; {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:15,146 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1112#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} {956#true} #86#return; {1081#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:15,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1112#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1112#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:15,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1112#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1112#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:15,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1122#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (not (= |#Ultimate.C_memset_#value| 0)) (forall ((v_ArrVal_92 Int)) (= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_92) |#Ultimate.C_memset_#ptr.offset|) 256) 0)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1112#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:15,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (not (= |#Ultimate.C_memset_#value| 0)) (not (< (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616))) (= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1122#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (not (= |#Ultimate.C_memset_#value| 0)) (forall ((v_ArrVal_92 Int)) (= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_92) |#Ultimate.C_memset_#ptr.offset|) 256) 0)))} is VALID [2022-02-20 21:10:15,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {956#true} #t~loopctr676 := 0; {1126#(or (not (= 15 |#Ultimate.C_memset_#amount|)) (not (= |#Ultimate.C_memset_#value| 0)) (not (< (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616))) (= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:15,149 INFO L272 TraceCheckUtils]: 9: Hoare triple {956#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {956#true} is VALID [2022-02-20 21:10:15,149 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {956#true} {956#true} #84#return; {956#true} is VALID [2022-02-20 21:10:15,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#true} assume true; {956#true} is VALID [2022-02-20 21:10:15,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#true} assume !(0 == ~cond % 256); {956#true} is VALID [2022-02-20 21:10:15,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#true} ~cond := #in~cond; {956#true} is VALID [2022-02-20 21:10:15,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {956#true} is VALID [2022-02-20 21:10:15,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {956#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {956#true} is VALID [2022-02-20 21:10:15,152 INFO L272 TraceCheckUtils]: 2: Hoare triple {956#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {956#true} is VALID [2022-02-20 21:10:15,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {956#true} is VALID [2022-02-20 21:10:15,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {956#true} is VALID [2022-02-20 21:10:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:15,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181559848] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:10:15,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:10:15,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2022-02-20 21:10:15,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499057049] [2022-02-20 21:10:15,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:10:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 28 [2022-02-20 21:10:15,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:15,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:15,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:15,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 21:10:15,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 21:10:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-02-20 21:10:15,331 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:15,784 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-02-20 21:10:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 21:10:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 28 [2022-02-20 21:10:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2022-02-20 21:10:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2022-02-20 21:10:15,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 78 transitions. [2022-02-20 21:10:15,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:15,860 INFO L225 Difference]: With dead ends: 67 [2022-02-20 21:10:15,861 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 21:10:15,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-02-20 21:10:15,861 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:15,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 191 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2022-02-20 21:10:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 21:10:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-02-20 21:10:15,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:15,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:15,882 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:15,883 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:15,884 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-20 21:10:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-02-20 21:10:15,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:15,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:15,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-02-20 21:10:15,885 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-02-20 21:10:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:15,886 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-20 21:10:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-02-20 21:10:15,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:15,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:15,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:15,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 21:10:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 21:10:15,911 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2022-02-20 21:10:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:15,912 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 21:10:15,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 21:10:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 21:10:15,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:15,913 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:15,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 21:10:16,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 21:10:16,121 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1821332694, now seen corresponding path program 3 times [2022-02-20 21:10:16,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:16,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231082922] [2022-02-20 21:10:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:16,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2022-02-20 21:10:16,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume !(0 == ~cond % 256); {1402#true} is VALID [2022-02-20 21:10:16,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 21:10:16,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1402#true} {1402#true} #84#return; {1402#true} is VALID [2022-02-20 21:10:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:16,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {1420#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {1421#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:16,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1422#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:16,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1422#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1423#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:16,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {1423#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1424#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 3)))} is VALID [2022-02-20 21:10:16,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {1424#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 3)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} is VALID [2022-02-20 21:10:16,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} is VALID [2022-02-20 21:10:16,322 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} {1402#true} #86#return; {1403#false} is VALID [2022-02-20 21:10:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 21:10:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:16,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1402#true} is VALID [2022-02-20 21:10:16,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1402#true} is VALID [2022-02-20 21:10:16,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {1402#true} is VALID [2022-02-20 21:10:16,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 21:10:16,334 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1402#true} {1403#false} #88#return; {1403#false} is VALID [2022-02-20 21:10:16,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1402#true} is VALID [2022-02-20 21:10:16,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {1402#true} is VALID [2022-02-20 21:10:16,335 INFO L272 TraceCheckUtils]: 2: Hoare triple {1402#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {1402#true} is VALID [2022-02-20 21:10:16,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1402#true} is VALID [2022-02-20 21:10:16,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {1402#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {1402#true} is VALID [2022-02-20 21:10:16,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2022-02-20 21:10:16,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#true} assume !(0 == ~cond % 256); {1402#true} is VALID [2022-02-20 21:10:16,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 21:10:16,336 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1402#true} {1402#true} #84#return; {1402#true} is VALID [2022-02-20 21:10:16,337 INFO L272 TraceCheckUtils]: 9: Hoare triple {1402#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {1420#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:16,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {1420#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {1421#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:16,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1422#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:16,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {1422#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1423#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:16,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {1423#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1424#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 3)))} is VALID [2022-02-20 21:10:16,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 3)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} is VALID [2022-02-20 21:10:16,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} is VALID [2022-02-20 21:10:16,342 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1425#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3))} {1402#true} #86#return; {1403#false} is VALID [2022-02-20 21:10:16,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {1403#false} havoc #t~memset~res292.base, #t~memset~res292.offset; {1403#false} is VALID [2022-02-20 21:10:16,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {1403#false} goto; {1403#false} is VALID [2022-02-20 21:10:16,342 INFO L272 TraceCheckUtils]: 19: Hoare triple {1403#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {1402#true} is VALID [2022-02-20 21:10:16,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {1402#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1402#true} is VALID [2022-02-20 21:10:16,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {1402#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1402#true} is VALID [2022-02-20 21:10:16,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {1402#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {1402#true} is VALID [2022-02-20 21:10:16,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 21:10:16,343 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1402#true} {1403#false} #88#return; {1403#false} is VALID [2022-02-20 21:10:16,343 INFO L272 TraceCheckUtils]: 25: Hoare triple {1403#false} call __VERIFIER_assert(#t~ret293); {1403#false} is VALID [2022-02-20 21:10:16,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {1403#false} ~cond := #in~cond; {1403#false} is VALID [2022-02-20 21:10:16,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {1403#false} assume 0 == ~cond % 256; {1403#false} is VALID [2022-02-20 21:10:16,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-02-20 21:10:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:16,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:16,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231082922] [2022-02-20 21:10:16,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231082922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:16,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995068064] [2022-02-20 21:10:16,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 21:10:16,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:16,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:10:16,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 21:10:16,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 21:10:16,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 21:10:16,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 21:10:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:16,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:16,593 INFO L390 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-02-20 21:10:16,632 INFO L356 Elim1Store]: treesize reduction 32, result has 23.8 percent of original size [2022-02-20 21:10:16,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-20 21:10:16,743 INFO L356 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2022-02-20 21:10:16,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-02-20 21:10:18,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1402#true} is VALID [2022-02-20 21:10:18,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {1402#true} is VALID [2022-02-20 21:10:18,032 INFO L272 TraceCheckUtils]: 2: Hoare triple {1402#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {1402#true} is VALID [2022-02-20 21:10:18,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1402#true} is VALID [2022-02-20 21:10:18,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {1402#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {1402#true} is VALID [2022-02-20 21:10:18,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2022-02-20 21:10:18,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#true} assume !(0 == ~cond % 256); {1402#true} is VALID [2022-02-20 21:10:18,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 21:10:18,033 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1402#true} {1402#true} #84#return; {1402#true} is VALID [2022-02-20 21:10:18,033 INFO L272 TraceCheckUtils]: 9: Hoare triple {1402#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {1402#true} is VALID [2022-02-20 21:10:18,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1402#true} #t~loopctr676 := 0; {1421#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:18,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1462#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:18,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {1462#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1466#(and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:18,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1466#(and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1470#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} is VALID [2022-02-20 21:10:18,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {1470#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1470#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} is VALID [2022-02-20 21:10:18,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {1470#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1470#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} is VALID [2022-02-20 21:10:18,042 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1470#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_24|))) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} {1402#true} #86#return; {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} is VALID [2022-02-20 21:10:18,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} havoc #t~memset~res292.base, #t~memset~res292.offset; {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} is VALID [2022-02-20 21:10:18,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} goto; {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} is VALID [2022-02-20 21:10:18,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {1490#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-02-20 21:10:20,047 WARN L290 TraceCheckUtils]: 20: Hoare triple {1490#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0)))} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1494#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} is UNKNOWN [2022-02-20 21:10:20,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {1494#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1498#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|)))} is VALID [2022-02-20 21:10:20,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {1498#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|)))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {1502#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is VALID [2022-02-20 21:10:22,055 WARN L290 TraceCheckUtils]: 23: Hoare triple {1502#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} assume true; {1502#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is UNKNOWN [2022-02-20 21:10:22,060 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1502#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 1) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_11) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_24| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_11)) 0))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} {1480#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_24| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 1) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_24|)) 0) (<= |v_#Ultimate.C_memset_#t~loopctr676_24| 2) (<= 2 |v_#Ultimate.C_memset_#t~loopctr676_24|)))} #88#return; {1403#false} is VALID [2022-02-20 21:10:22,060 INFO L272 TraceCheckUtils]: 25: Hoare triple {1403#false} call __VERIFIER_assert(#t~ret293); {1403#false} is VALID [2022-02-20 21:10:22,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {1403#false} ~cond := #in~cond; {1403#false} is VALID [2022-02-20 21:10:22,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {1403#false} assume 0 == ~cond % 256; {1403#false} is VALID [2022-02-20 21:10:22,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-02-20 21:10:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:22,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:10:23,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-02-20 21:10:23,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 304 [2022-02-20 21:10:23,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-02-20 21:10:23,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {1403#false} assume 0 == ~cond % 256; {1403#false} is VALID [2022-02-20 21:10:23,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {1403#false} ~cond := #in~cond; {1403#false} is VALID [2022-02-20 21:10:23,400 INFO L272 TraceCheckUtils]: 25: Hoare triple {1403#false} call __VERIFIER_assert(#t~ret293); {1403#false} is VALID [2022-02-20 21:10:23,401 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1537#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} #88#return; {1403#false} is VALID [2022-02-20 21:10:23,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {1537#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} assume true; {1537#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} is VALID [2022-02-20 21:10:23,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {1544#(or (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {1537#(not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0))} is VALID [2022-02-20 21:10:23,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256) 1)) (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {1544#(or (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} is VALID [2022-02-20 21:10:23,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {1402#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1548#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256) 1)) (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)))) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0)))} is VALID [2022-02-20 21:10:23,406 INFO L272 TraceCheckUtils]: 19: Hoare triple {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {1402#true} is VALID [2022-02-20 21:10:23,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} goto; {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:23,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} havoc #t~memset~res292.base, #t~memset~res292.offset; {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:23,408 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1564#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} {1402#true} #86#return; {1533#(= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)} is VALID [2022-02-20 21:10:23,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1564#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:23,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1564#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:23,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#(or (forall ((v_ArrVal_181 Int)) (= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_181) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1564#(or (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:23,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {1578#(or (not (= |#Ultimate.C_memset_#value| 0)) (forall ((v_ArrVal_181 Int)) (= (mod (select (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) v_ArrVal_181) |#Ultimate.C_memset_#ptr.offset|) 256) 0)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1574#(or (forall ((v_ArrVal_181 Int)) (= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_181) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:23,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {1582#(or (<= 18446744073709551615 (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (not (= |#Ultimate.C_memset_#value| 0)) (= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1578#(or (not (= |#Ultimate.C_memset_#value| 0)) (forall ((v_ArrVal_181 Int)) (= (mod (select (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) v_ArrVal_181) |#Ultimate.C_memset_#ptr.offset|) 256) 0)))} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1402#true} #t~loopctr676 := 0; {1582#(or (<= 18446744073709551615 (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (not (= |#Ultimate.C_memset_#value| 0)) (= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:23,415 INFO L272 TraceCheckUtils]: 9: Hoare triple {1402#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1402#true} {1402#true} #84#return; {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#true} assume !(0 == ~cond % 256); {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {1402#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L272 TraceCheckUtils]: 2: Hoare triple {1402#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {1402#true} is VALID [2022-02-20 21:10:23,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {1402#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1402#true} is VALID [2022-02-20 21:10:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:23,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995068064] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:10:23,416 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:10:23,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 24 [2022-02-20 21:10:23,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987918124] [2022-02-20 21:10:23,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:10:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29 [2022-02-20 21:10:23,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:23,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:31,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 56 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:31,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 21:10:31,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 21:10:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-02-20 21:10:31,499 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:32,539 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-02-20 21:10:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 21:10:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29 [2022-02-20 21:10:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2022-02-20 21:10:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2022-02-20 21:10:32,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 86 transitions. [2022-02-20 21:10:32,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:32,636 INFO L225 Difference]: With dead ends: 73 [2022-02-20 21:10:32,636 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 21:10:32,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2022-02-20 21:10:32,637 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:32,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 164 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 263 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2022-02-20 21:10:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 21:10:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-02-20 21:10:32,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:32,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 21:10:32,658 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 21:10:32,658 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 21:10:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:32,659 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 21:10:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 21:10:32,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:32,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:32,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 49 states. [2022-02-20 21:10:32,660 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 49 states. [2022-02-20 21:10:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:32,662 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 21:10:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 21:10:32,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:32,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:32,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:32,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 21:10:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-20 21:10:32,664 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2022-02-20 21:10:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:32,664 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-20 21:10:32,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 21:10:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 21:10:32,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:32,665 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:32,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 21:10:32,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:32,878 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash -996879181, now seen corresponding path program 1 times [2022-02-20 21:10:32,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:32,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728370920] [2022-02-20 21:10:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:32,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-02-20 21:10:32,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume !(0 == ~cond % 256); {1890#true} is VALID [2022-02-20 21:10:32,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-02-20 21:10:32,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #84#return; {1890#true} is VALID [2022-02-20 21:10:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:32,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {1912#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {1890#true} is VALID [2022-02-20 21:10:32,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1890#true} is VALID [2022-02-20 21:10:32,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1890#true} is VALID [2022-02-20 21:10:32,965 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1890#true} {1890#true} #86#return; {1890#true} is VALID [2022-02-20 21:10:32,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:10:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:32,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {1890#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1890#true} is VALID [2022-02-20 21:10:32,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume !(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616); {1890#true} is VALID [2022-02-20 21:10:32,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} #res := 1; {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} is VALID [2022-02-20 21:10:32,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} assume true; {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} is VALID [2022-02-20 21:10:32,988 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} {1890#true} #88#return; {1909#(= |aws_linked_list_node_reset_#t~ret293| 1)} is VALID [2022-02-20 21:10:32,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {1890#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1890#true} is VALID [2022-02-20 21:10:32,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {1890#true} is VALID [2022-02-20 21:10:32,988 INFO L272 TraceCheckUtils]: 2: Hoare triple {1890#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {1890#true} is VALID [2022-02-20 21:10:32,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {1890#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1890#true} is VALID [2022-02-20 21:10:32,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {1890#true} is VALID [2022-02-20 21:10:32,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-02-20 21:10:32,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#true} assume !(0 == ~cond % 256); {1890#true} is VALID [2022-02-20 21:10:32,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-02-20 21:10:32,989 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1890#true} {1890#true} #84#return; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L272 TraceCheckUtils]: 9: Hoare triple {1890#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {1912#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1912#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1890#true} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {1890#true} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {1890#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1890#true} {1890#true} #86#return; {1890#true} is VALID [2022-02-20 21:10:32,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {1890#true} havoc #t~memset~res292.base, #t~memset~res292.offset; {1890#true} is VALID [2022-02-20 21:10:32,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {1890#true} goto; {1890#true} is VALID [2022-02-20 21:10:32,991 INFO L272 TraceCheckUtils]: 20: Hoare triple {1890#true} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {1890#true} is VALID [2022-02-20 21:10:32,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {1890#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {1890#true} is VALID [2022-02-20 21:10:32,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {1890#true} assume !(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616); {1890#true} is VALID [2022-02-20 21:10:32,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {1890#true} #res := 1; {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} is VALID [2022-02-20 21:10:32,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} assume true; {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} is VALID [2022-02-20 21:10:32,992 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1913#(and (<= 1 |aws_is_mem_zeroed_#res|) (<= |aws_is_mem_zeroed_#res| 1))} {1890#true} #88#return; {1909#(= |aws_linked_list_node_reset_#t~ret293| 1)} is VALID [2022-02-20 21:10:32,993 INFO L272 TraceCheckUtils]: 26: Hoare triple {1909#(= |aws_linked_list_node_reset_#t~ret293| 1)} call __VERIFIER_assert(#t~ret293); {1910#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-02-20 21:10:32,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {1910#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1911#(= (+ (- 1) __VERIFIER_assert_~cond) 0)} is VALID [2022-02-20 21:10:32,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {1911#(= (+ (- 1) __VERIFIER_assert_~cond) 0)} assume 0 == ~cond % 256; {1891#false} is VALID [2022-02-20 21:10:32,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-02-20 21:10:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 21:10:32,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:32,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728370920] [2022-02-20 21:10:32,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728370920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:32,994 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:32,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:10:32,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642309212] [2022-02-20 21:10:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:32,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-02-20 21:10:32,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:32,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:10:33,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:33,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:10:33,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:10:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:10:33,012 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:10:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:33,305 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-02-20 21:10:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:10:33,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-02-20 21:10:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:10:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-02-20 21:10:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:10:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-02-20 21:10:33,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-02-20 21:10:33,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:33,360 INFO L225 Difference]: With dead ends: 54 [2022-02-20 21:10:33,360 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 21:10:33,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:10:33,361 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:33,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:10:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 21:10:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-02-20 21:10:33,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:33,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:33,406 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:33,406 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:33,408 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-02-20 21:10:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-20 21:10:33,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:33,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:33,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Second operand 52 states. [2022-02-20 21:10:33,408 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Second operand 52 states. [2022-02-20 21:10:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:33,409 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-02-20 21:10:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-20 21:10:33,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:33,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:33,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:33,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-02-20 21:10:33,411 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 30 [2022-02-20 21:10:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:33,411 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-02-20 21:10:33,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:10:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 21:10:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 21:10:33,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:33,411 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:33,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:10:33,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 508754072, now seen corresponding path program 1 times [2022-02-20 21:10:33,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:33,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627960544] [2022-02-20 21:10:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:33,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:33,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-02-20 21:10:33,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} assume !(0 == ~cond % 256); {2173#true} is VALID [2022-02-20 21:10:33,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-02-20 21:10:33,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #84#return; {2173#true} is VALID [2022-02-20 21:10:33,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:33,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {2195#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {2196#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:33,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2197#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:33,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2198#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:33,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {2198#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2199#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:33,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {2199#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2200#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 4)))} is VALID [2022-02-20 21:10:33,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {2200#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 4)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:33,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:33,605 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} {2173#true} #86#return; {2174#false} is VALID [2022-02-20 21:10:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:10:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:33,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2173#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {2173#true} is VALID [2022-02-20 21:10:33,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2173#true} is VALID [2022-02-20 21:10:33,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {2173#true} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2173#true} is VALID [2022-02-20 21:10:33,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {2173#true} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {2173#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2173#true} {2174#false} #88#return; {2174#false} is VALID [2022-02-20 21:10:33,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2173#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L272 TraceCheckUtils]: 2: Hoare triple {2173#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {2173#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {2173#true} is VALID [2022-02-20 21:10:33,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {2173#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {2173#true} is VALID [2022-02-20 21:10:33,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-02-20 21:10:33,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !(0 == ~cond % 256); {2173#true} is VALID [2022-02-20 21:10:33,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-02-20 21:10:33,621 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2173#true} {2173#true} #84#return; {2173#true} is VALID [2022-02-20 21:10:33,622 INFO L272 TraceCheckUtils]: 9: Hoare triple {2173#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {2195#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:33,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {2195#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {2196#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:33,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {2196#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2197#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:33,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {2197#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2198#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:33,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {2198#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2199#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:33,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {2199#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2200#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 4)))} is VALID [2022-02-20 21:10:33,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {2200#(and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (or (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 4)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:33,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 21:10:33,635 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2201#(or (<= |#Ultimate.C_memset_#amount| 4) (<= 18446744073709551617 |#Ultimate.C_memset_#amount|))} {2173#true} #86#return; {2174#false} is VALID [2022-02-20 21:10:33,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {2174#false} havoc #t~memset~res292.base, #t~memset~res292.offset; {2174#false} is VALID [2022-02-20 21:10:33,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {2174#false} goto; {2174#false} is VALID [2022-02-20 21:10:33,635 INFO L272 TraceCheckUtils]: 20: Hoare triple {2174#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {2173#true} is VALID [2022-02-20 21:10:33,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2173#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {2173#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {2173#true} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {2173#true} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {2173#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {2173#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-02-20 21:10:33,636 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2173#true} {2174#false} #88#return; {2174#false} is VALID [2022-02-20 21:10:33,636 INFO L272 TraceCheckUtils]: 29: Hoare triple {2174#false} call __VERIFIER_assert(#t~ret293); {2174#false} is VALID [2022-02-20 21:10:33,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-02-20 21:10:33,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {2174#false} assume 0 == ~cond % 256; {2174#false} is VALID [2022-02-20 21:10:33,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-02-20 21:10:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:10:33,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:33,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627960544] [2022-02-20 21:10:33,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627960544] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:33,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965776674] [2022-02-20 21:10:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:33,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:10:33,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 21:10:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:33,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 21:10:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:33,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:33,809 INFO L390 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-02-20 21:10:34,113 INFO L356 Elim1Store]: treesize reduction 32, result has 23.8 percent of original size [2022-02-20 21:10:34,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-20 21:10:34,184 INFO L356 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2022-02-20 21:10:34,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-02-20 21:10:34,283 INFO L356 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2022-02-20 21:10:34,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-02-20 21:10:36,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {2173#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {2173#true} is VALID [2022-02-20 21:10:36,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {2173#true} is VALID [2022-02-20 21:10:36,495 INFO L272 TraceCheckUtils]: 2: Hoare triple {2173#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {2173#true} is VALID [2022-02-20 21:10:36,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {2173#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {2173#true} is VALID [2022-02-20 21:10:36,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {2173#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {2173#true} is VALID [2022-02-20 21:10:36,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-02-20 21:10:36,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !(0 == ~cond % 256); {2173#true} is VALID [2022-02-20 21:10:36,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-02-20 21:10:36,496 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2173#true} {2173#true} #84#return; {2173#true} is VALID [2022-02-20 21:10:36,496 INFO L272 TraceCheckUtils]: 9: Hoare triple {2173#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {2173#true} is VALID [2022-02-20 21:10:36,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {2173#true} #t~loopctr676 := 0; {2196#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:36,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {2196#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2238#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 1 |#Ultimate.C_memset_#t~loopctr676|) (< (mod (+ 18446744073709551615 |#Ultimate.C_memset_#t~loopctr676|) 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616)))} is VALID [2022-02-20 21:10:36,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {2238#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 1 |#Ultimate.C_memset_#t~loopctr676|) (< (mod (+ 18446744073709551615 |#Ultimate.C_memset_#t~loopctr676|) 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2242#(and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:36,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 1) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2246#(and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| (- 3)))) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:36,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {2246#(and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| (- 3)))) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2250#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} is VALID [2022-02-20 21:10:36,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {2250#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {2250#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} is VALID [2022-02-20 21:10:36,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {2250#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2250#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} is VALID [2022-02-20 21:10:36,506 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2250#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ (- 2) |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= |#Ultimate.C_memset_#value| (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr676_39|))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} {2173#true} #86#return; {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} is VALID [2022-02-20 21:10:36,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} havoc #t~memset~res292.base, #t~memset~res292.offset; {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} is VALID [2022-02-20 21:10:36,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} goto; {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} is VALID [2022-02-20 21:10:36,510 INFO L272 TraceCheckUtils]: 20: Hoare triple {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {2270#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} is VALID [2022-02-20 21:10:38,513 WARN L290 TraceCheckUtils]: 21: Hoare triple {2270#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3)))} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {2274#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} is UNKNOWN [2022-02-20 21:10:40,519 WARN L290 TraceCheckUtils]: 22: Hoare triple {2274#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2278#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} is UNKNOWN [2022-02-20 21:10:42,523 WARN L290 TraceCheckUtils]: 23: Hoare triple {2278#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2282#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (<= (mod (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) 256) 0) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} is UNKNOWN [2022-02-20 21:10:44,532 WARN L290 TraceCheckUtils]: 24: Hoare triple {2282#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (<= (mod (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) 256) 0) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= aws_is_mem_zeroed_~i~0 0))} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2286#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (<= (mod (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 18446744073709551615) 18446744073709551616))) 256) 0) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= (+ aws_is_mem_zeroed_~i~0 (- 1)) 0))} is UNKNOWN [2022-02-20 21:10:44,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {2286#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (= aws_is_mem_zeroed_~buf_u8~0.offset |aws_is_mem_zeroed_#in~buf.offset|) (<= (mod (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 18446744073709551615) 18446744073709551616))) 256) 0) (= aws_is_mem_zeroed_~buf_u8~0.base |aws_is_mem_zeroed_#in~buf.base|) (= (+ aws_is_mem_zeroed_~i~0 (- 1)) 0))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2290#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1))))} is VALID [2022-02-20 21:10:44,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {2290#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (= |aws_is_mem_zeroed_#t~mem47| (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1))))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {2294#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} is VALID [2022-02-20 21:10:46,546 WARN L290 TraceCheckUtils]: 27: Hoare triple {2294#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} assume true; {2294#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} is UNKNOWN [2022-02-20 21:10:46,547 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2294#(and (exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int) (v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16 Int)) (and (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) 0) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (= (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ (- 2) |v_#Ultimate.C_memset_#t~loopctr676_39| v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) (select (select |#memory_int| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_16) (+ |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3) v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3))) (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} {2260#(exists ((|v_#Ultimate.C_memset_#t~loopctr676_39| Int)) (and (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) 0) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3)))) (<= 3 |v_#Ultimate.C_memset_#t~loopctr676_39|) (<= |v_#Ultimate.C_memset_#t~loopctr676_39| 3) (= (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39| (- 3))) (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ (- 2) aws_linked_list_node_reset_~node.offset |v_#Ultimate.C_memset_#t~loopctr676_39|)))))} #88#return; {2174#false} is VALID [2022-02-20 21:10:46,547 INFO L272 TraceCheckUtils]: 29: Hoare triple {2174#false} call __VERIFIER_assert(#t~ret293); {2174#false} is VALID [2022-02-20 21:10:46,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-02-20 21:10:46,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {2174#false} assume 0 == ~cond % 256; {2174#false} is VALID [2022-02-20 21:10:46,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-02-20 21:10:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:46,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:10:48,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-02-20 21:10:48,972 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 21:10:48,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3768 treesize of output 3732 [2022-02-20 21:10:50,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-02-20 21:10:50,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {2174#false} assume 0 == ~cond % 256; {2174#false} is VALID [2022-02-20 21:10:50,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-02-20 21:10:50,475 INFO L272 TraceCheckUtils]: 29: Hoare triple {2174#false} call __VERIFIER_assert(#t~ret293); {2174#false} is VALID [2022-02-20 21:10:50,476 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2329#(and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} #88#return; {2174#false} is VALID [2022-02-20 21:10:50,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {2329#(and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} assume true; {2329#(and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} is VALID [2022-02-20 21:10:50,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {2336#(or (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {2329#(and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0)))} is VALID [2022-02-20 21:10:50,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {2340#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256) 1)) (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2336#(or (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))) (= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0))} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {2344#(or (and (or (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807) (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1))) (or (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1)) (not (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2340#(or (and (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ (div (+ (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))) (- 256)) 256) 1)) (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (or (<= (div (- (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) (- 256)) (+ 1 (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))) (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} is VALID [2022-02-20 21:10:50,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {2348#(or (not (<= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0)) (and (or (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807) (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1))) (or (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1)) (not (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2344#(or (and (or (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807) (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1))) (or (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1)) (not (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} is VALID [2022-02-20 21:10:50,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {2352#(or (and (or (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (< (div (+ (- 1) (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))))) (- 256)) (+ (div (+ (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256) 2))) (or (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807) (< (div (+ (- 1) (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))))) (- 256)) (+ 2 (div (+ (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))))) (and (or (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807) (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1))) (or (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1)) (not (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2348#(or (not (<= (mod |aws_is_mem_zeroed_#t~mem47| 256) 0)) (and (or (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807) (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1))) (or (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1)) (not (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} is VALID [2022-02-20 21:10:50,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {2173#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {2352#(or (and (or (not (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807)) (< (div (+ (- 1) (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))))) (- 256)) (+ (div (+ (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256) 2))) (or (<= (mod aws_is_mem_zeroed_~i~0 18446744073709551616) 9223372036854775807) (< (div (+ (- 1) (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616))))) (- 256)) (+ 2 (div (+ (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod aws_is_mem_zeroed_~i~0 18446744073709551616)))) 256))))) (and (or (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807) (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ (- 18446744073709551616) aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1))) (or (<= (div (* (- 1) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) (- 256)) (+ (div (+ (- 256) (select (select |#memory_int| aws_is_mem_zeroed_~buf_u8~0.base) (+ aws_is_mem_zeroed_~buf_u8~0.offset (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616)))) 256) 1)) (not (<= (mod (+ aws_is_mem_zeroed_~i~0 1) 18446744073709551616) 9223372036854775807)))) (and (<= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) |aws_is_mem_zeroed_#in~buf.offset|) 256) 0) (not (= (mod (select (select |#memory_int| |aws_is_mem_zeroed_#in~buf.base|) (+ |aws_is_mem_zeroed_#in~buf.offset| 1)) 256) 0))))} is VALID [2022-02-20 21:10:50,490 INFO L272 TraceCheckUtils]: 20: Hoare triple {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {2173#true} is VALID [2022-02-20 21:10:50,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} goto; {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} is VALID [2022-02-20 21:10:50,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} havoc #t~memset~res292.base, #t~memset~res292.offset; {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} is VALID [2022-02-20 21:10:50,493 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2368#(or (not (<= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} {2173#true} #86#return; {2325#(or (not (<= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) aws_linked_list_node_reset_~node.offset) 256) 0)) (= (mod (select (select |#memory_int| aws_linked_list_node_reset_~node.base) (+ aws_linked_list_node_reset_~node.offset 1)) 256) 0))} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {2368#(or (not (<= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2368#(or (not (<= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {2368#(or (not (<= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {2368#(or (not (<= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} is VALID [2022-02-20 21:10:50,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {2378#(or (not (<= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2368#(or (not (<= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} is VALID [2022-02-20 21:10:50,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {2382#(or (forall ((v_ArrVal_364 Int)) (or (not (<= (mod (select (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) |#Ultimate.C_memset_#value|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (= (mod (select (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))) (not (= |#Ultimate.C_memset_#value| 0)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2378#(or (not (<= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= (mod (select (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {2386#(or (not (= |#Ultimate.C_memset_#value| 0)) (forall ((v_ArrVal_364 Int)) (or (= (mod (select (store (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 2) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0) (not (<= (mod (select (store (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 2) |#Ultimate.C_memset_#value|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)))) (not (< (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616))))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2382#(or (forall ((v_ArrVal_364 Int)) (or (not (<= (mod (select (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) |#Ultimate.C_memset_#value|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)) (= (mod (select (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0))) (not (= |#Ultimate.C_memset_#value| 0)))} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {2390#(or (= |#Ultimate.C_memset_#t~loopctr676| 1) (not (= |#Ultimate.C_memset_#value| 0)) (<= (div (+ (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) (- 18446744073709551615)) (- 18446744073709551616)) 0) (= |#Ultimate.C_memset_#t~loopctr676| 0) (<= 18446744073709551615 (mod (+ |#Ultimate.C_memset_#t~loopctr676| 1) 18446744073709551616)))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2386#(or (not (= |#Ultimate.C_memset_#value| 0)) (forall ((v_ArrVal_364 Int)) (or (= (mod (select (store (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 2) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| 1)) 256) 0) (not (<= (mod (select (store (store (store (select |#memory_int| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676|) |#Ultimate.C_memset_#value|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 1) v_ArrVal_364) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr676| 2) |#Ultimate.C_memset_#value|) |#Ultimate.C_memset_#ptr.offset|) 256) 0)))) (not (< (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) (mod |#Ultimate.C_memset_#amount| 18446744073709551616))))} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {2173#true} #t~loopctr676 := 0; {2390#(or (= |#Ultimate.C_memset_#t~loopctr676| 1) (not (= |#Ultimate.C_memset_#value| 0)) (<= (div (+ (mod |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) (- 18446744073709551615)) (- 18446744073709551616)) 0) (= |#Ultimate.C_memset_#t~loopctr676| 0) (<= 18446744073709551615 (mod (+ |#Ultimate.C_memset_#t~loopctr676| 1) 18446744073709551616)))} is VALID [2022-02-20 21:10:50,507 INFO L272 TraceCheckUtils]: 9: Hoare triple {2173#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2173#true} {2173#true} #84#return; {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !(0 == ~cond % 256); {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {2173#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {2173#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L272 TraceCheckUtils]: 2: Hoare triple {2173#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {2173#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {2173#true} is VALID [2022-02-20 21:10:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:10:50,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965776674] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:10:50,508 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:10:50,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 33 [2022-02-20 21:10:50,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055769621] [2022-02-20 21:10:50,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:10:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2022-02-20 21:10:50,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:50,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:56,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 68 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:56,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-20 21:10:56,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:56,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-20 21:10:56,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 21:10:56,626 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:58,649 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-02-20 21:10:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 21:10:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2022-02-20 21:10:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-02-20 21:10:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-02-20 21:10:58,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-02-20 21:10:58,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:58,757 INFO L225 Difference]: With dead ends: 95 [2022-02-20 21:10:58,757 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 21:10:58,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=1774, Unknown=2, NotChecked=0, Total=1980 [2022-02-20 21:10:58,758 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 32 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:58,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 212 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 206 Unchecked, 0.6s Time] [2022-02-20 21:10:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 21:10:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-02-20 21:10:58,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:58,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:58,792 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:58,793 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:58,794 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-20 21:10:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 21:10:58,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:58,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:58,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Second operand 60 states. [2022-02-20 21:10:58,795 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Second operand 60 states. [2022-02-20 21:10:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:58,796 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-20 21:10:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 21:10:58,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:58,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:58,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-02-20 21:10:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-02-20 21:10:58,798 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 33 [2022-02-20 21:10:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:58,799 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-02-20 21:10:58,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 21:10:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-02-20 21:10:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 21:10:58,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:58,799 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:58,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 21:10:59,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:59,012 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1979289706, now seen corresponding path program 2 times [2022-02-20 21:10:59,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:59,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604542612] [2022-02-20 21:10:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:10:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:59,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-02-20 21:10:59,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#true} assume !(0 == ~cond % 256); {2772#true} is VALID [2022-02-20 21:10:59,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-02-20 21:10:59,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #84#return; {2772#true} is VALID [2022-02-20 21:10:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:10:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:59,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2798#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {2799#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:59,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {2799#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2800#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:59,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2801#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:59,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {2801#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2802#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:59,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {2802#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2803#(and (<= 4 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 4))} is VALID [2022-02-20 21:10:59,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {2803#(and (<= 4 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 4))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2804#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 5)))} is VALID [2022-02-20 21:10:59,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {2804#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 5)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} is VALID [2022-02-20 21:10:59,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} is VALID [2022-02-20 21:10:59,263 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} {2772#true} #86#return; {2773#false} is VALID [2022-02-20 21:10:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:10:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:59,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {2772#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {2772#true} is VALID [2022-02-20 21:10:59,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2772#true} is VALID [2022-02-20 21:10:59,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {2772#true} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2772#true} is VALID [2022-02-20 21:10:59,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {2772#true} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {2772#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {2772#true} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {2772#true} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {2772#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {2772#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2772#true} {2773#false} #88#return; {2773#false} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {2772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {2772#true} is VALID [2022-02-20 21:10:59,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_node_reset_harness } true;havoc aws_linked_list_node_reset_harness_#t~ret674#1, aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset;call aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset := #Ultimate.allocOnStack(16); {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L272 TraceCheckUtils]: 2: Hoare triple {2772#true} call aws_linked_list_node_reset(aws_linked_list_node_reset_harness_~#node~1#1.base, aws_linked_list_node_reset_harness_~#node~1#1.offset); {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {2772#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {2772#true} call assume_abort_if_not((if 0 == (if ~node.base != 0 || ~node.offset != 0 then 1 else 0) then 0 else 1)); {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {2772#true} assume !(0 == ~cond % 256); {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-02-20 21:10:59,276 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2772#true} {2772#true} #84#return; {2772#true} is VALID [2022-02-20 21:10:59,277 INFO L272 TraceCheckUtils]: 9: Hoare triple {2772#true} call #t~memset~res292.base, #t~memset~res292.offset := #Ultimate.C_memset(~node.base, ~node.offset, 0, 15); {2798#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:10:59,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {2798#(and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr676 := 0; {2799#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} is VALID [2022-02-20 21:10:59,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {2799#(and (<= 0 |#Ultimate.C_memset_#t~loopctr676|) (<= |#Ultimate.C_memset_#t~loopctr676| 0))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2800#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:59,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#(and (<= |#Ultimate.C_memset_#t~loopctr676| 1) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2801#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} is VALID [2022-02-20 21:10:59,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {2801#(and (<= 2 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 2))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2802#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} is VALID [2022-02-20 21:10:59,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {2802#(and (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr676|))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2803#(and (<= 4 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 4))} is VALID [2022-02-20 21:10:59,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2803#(and (<= 4 |#Ultimate.C_memset_#t~loopctr676|) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr676| 4))} assume #t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr676 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr676 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr676 := #value % 256];#memory_real := #memory_real[#ptr.base,#ptr.offset + #t~loopctr676 := ~convertUCHARToFLOAT(#value)];#t~loopctr676 := 1 + #t~loopctr676; {2804#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 5)))} is VALID [2022-02-20 21:10:59,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#(and (or (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616) 1) 0)) (<= (+ (* 18446744073709551616 (div |#Ultimate.C_memset_#amount| 18446744073709551616)) 1) |#Ultimate.C_memset_#amount|)) (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (or (not (<= (div |#Ultimate.C_memset_#amount| 18446744073709551616) (div |#Ultimate.C_memset_#t~loopctr676| 18446744073709551616))) (<= |#Ultimate.C_memset_#t~loopctr676| 5)))} assume !(#t~loopctr676 % 18446744073709551616 < #amount % 18446744073709551616); {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} is VALID [2022-02-20 21:10:59,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} is VALID [2022-02-20 21:10:59,283 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2805#(or (<= 18446744073709551617 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 5))} {2772#true} #86#return; {2773#false} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {2773#false} havoc #t~memset~res292.base, #t~memset~res292.offset; {2773#false} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {2773#false} goto; {2773#false} is VALID [2022-02-20 21:10:59,284 INFO L272 TraceCheckUtils]: 21: Hoare triple {2773#false} call #t~ret293 := aws_is_mem_zeroed(~node.base, ~node.offset, 16); {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {2772#true} ~buf.base, ~buf.offset := #in~buf.base, #in~buf.offset;~bufsize := #in~bufsize;havoc ~i~0;~buf_u8~0.base, ~buf_u8~0.offset := ~buf.base, ~buf.offset;~i~0 := 0; {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {2772#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {2772#true} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2772#true} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {2772#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {2772#true} assume !(0 != #t~mem47 % 256);havoc #t~mem47; {2772#true} is VALID [2022-02-20 21:10:59,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {2772#true} #t~pre46 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre46; {2772#true} is VALID [2022-02-20 21:10:59,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {2772#true} assume !!(~i~0 % 18446744073709551616 < ~bufsize % 18446744073709551616);call #t~mem47 := read~int(~buf_u8~0.base, ~buf_u8~0.offset + (if ~i~0 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~i~0 % 18446744073709551616 % 18446744073709551616 else ~i~0 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); {2772#true} is VALID [2022-02-20 21:10:59,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {2772#true} assume 0 != #t~mem47 % 256;havoc #t~mem47;#res := 0; {2772#true} is VALID [2022-02-20 21:10:59,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-02-20 21:10:59,285 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2772#true} {2773#false} #88#return; {2773#false} is VALID [2022-02-20 21:10:59,285 INFO L272 TraceCheckUtils]: 33: Hoare triple {2773#false} call __VERIFIER_assert(#t~ret293); {2773#false} is VALID [2022-02-20 21:10:59,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {2773#false} ~cond := #in~cond; {2773#false} is VALID [2022-02-20 21:10:59,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {2773#false} assume 0 == ~cond % 256; {2773#false} is VALID [2022-02-20 21:10:59,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2022-02-20 21:10:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 21:10:59,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:59,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604542612] [2022-02-20 21:10:59,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604542612] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:59,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125710931] [2022-02-20 21:10:59,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 21:10:59,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:59,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:59,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:10:59,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 21:10:59,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 21:10:59,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 21:10:59,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 21:10:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:59,495 INFO L390 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-02-20 21:10:59,541 INFO L356 Elim1Store]: treesize reduction 32, result has 23.8 percent of original size [2022-02-20 21:10:59,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-20 21:10:59,881 INFO L356 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2022-02-20 21:10:59,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-02-20 21:11:00,025 INFO L356 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2022-02-20 21:11:00,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 49 [2022-02-20 21:11:00,284 INFO L356 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2022-02-20 21:11:00,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61