./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 376fa3967c5a16dbeae94f1517cf176a2f53d2660c6b5c3d2eeb4fd9f827337c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:42:48,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:42:48,128 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-28 23:42:48,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:42:48,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:42:48,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:42:48,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:42:48,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:42:48,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:42:48,158 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:42:48,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:42:48,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:42:48,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:42:48,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:42:48,161 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:42:48,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:42:48,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:42:48,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:42:48,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:42:48,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:42:48,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:42:48,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:42:48,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:42:48,165 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:42:48,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:42:48,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:42:48,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:42:48,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:42:48,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:42:48,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:42:48,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:42:48,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:42:48,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:42:48,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:42:48,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:42:48,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:42:48,170 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:42:48,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:42:48,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:42:48,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 376fa3967c5a16dbeae94f1517cf176a2f53d2660c6b5c3d2eeb4fd9f827337c [2023-11-28 23:42:48,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:42:48,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:42:48,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:42:48,422 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:42:48,422 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:42:48,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i [2023-11-28 23:42:51,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:42:51,638 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:42:51,638 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i [2023-11-28 23:42:51,666 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/data/f7bf287b7/9188ddd0cfef423988ff8bf9994ad9c0/FLAGfb6962df8 [2023-11-28 23:42:51,678 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/data/f7bf287b7/9188ddd0cfef423988ff8bf9994ad9c0 [2023-11-28 23:42:51,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:42:51,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:42:51,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:42:51,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:42:51,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:42:51,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:51" (1/1) ... [2023-11-28 23:42:51,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403f72a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:51, skipping insertion in model container [2023-11-28 23:42:51,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:51" (1/1) ... [2023-11-28 23:42:51,776 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:42:51,989 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4492,4505] [2023-11-28 23:42:51,996 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4552,4565] [2023-11-28 23:42:52,775 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,778 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,779 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,794 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,795 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,797 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:52,797 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,158 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-28 23:42:53,159 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-28 23:42:53,160 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-28 23:42:53,161 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-28 23:42:53,163 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-28 23:42:53,164 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-28 23:42:53,164 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-28 23:42:53,165 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-28 23:42:53,166 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-28 23:42:53,167 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-28 23:42:53,409 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,409 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:42:53,525 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:42:53,539 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4492,4505] [2023-11-28 23:42:53,539 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4552,4565] [2023-11-28 23:42:53,574 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,574 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,574 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,575 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,575 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,581 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,581 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,582 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,582 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,613 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-28 23:42:53,614 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-28 23:42:53,615 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-28 23:42:53,616 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-28 23:42:53,616 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-28 23:42:53,617 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-28 23:42:53,617 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-28 23:42:53,618 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-28 23:42:53,618 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-28 23:42:53,618 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-28 23:42:53,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8277] [2023-11-28 23:42:53,747 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,747 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 23:42:53,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8763-8774] [2023-11-28 23:42:53,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:42:54,002 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,002 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,002 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,002 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,002 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,003 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,004 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,004 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,004 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,004 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,004 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:54,010 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:42:54,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54 WrapperNode [2023-11-28 23:42:54,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:42:54,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:42:54,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:42:54,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:42:54,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,187 INFO L138 Inliner]: procedures = 690, calls = 2653, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 873 [2023-11-28 23:42:54,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:42:54,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:42:54,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:42:54,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:42:54,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,293 INFO L175 MemorySlicer]: Split 546 memory accesses to 8 slices as follows [2, 5, 256, 236, 34, 4, 6, 3]. 47 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 5, 256, 236, 0, 0, 0, 3]. The 5 writes are split as follows [0, 0, 0, 0, 3, 0, 2, 0]. [2023-11-28 23:42:54,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:42:54,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:42:54,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:42:54,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:42:54,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (1/1) ... [2023-11-28 23:42:54,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:42:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:42:54,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:42:54,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:42:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-28 23:42:54,446 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-28 23:42:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-28 23:42:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-28 23:42:54,447 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-28 23:42:54,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-28 23:42:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-28 23:42:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-28 23:42:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2023-11-28 23:42:54,448 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2023-11-28 23:42:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-28 23:42:54,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-28 23:42:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2023-11-28 23:42:54,449 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-28 23:42:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-28 23:42:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-28 23:42:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-28 23:42:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-28 23:42:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:42:54,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:42:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-28 23:42:54,451 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-28 23:42:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-28 23:42:54,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-28 23:42:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 23:42:54,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 23:42:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:42:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 23:42:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-28 23:42:54,452 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2023-11-28 23:42:54,453 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-28 23:42:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-28 23:42:54,454 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 23:42:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2023-11-28 23:42:54,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:42:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 23:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 23:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-28 23:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-28 23:42:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-28 23:42:54,735 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:42:54,737 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:42:55,671 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:42:55,843 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:42:55,843 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:42:55,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:55 BoogieIcfgContainer [2023-11-28 23:42:55,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:42:55,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:42:55,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:42:55,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:42:55,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:42:51" (1/3) ... [2023-11-28 23:42:55,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e501db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:42:55, skipping insertion in model container [2023-11-28 23:42:55,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:54" (2/3) ... [2023-11-28 23:42:55,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e501db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:42:55, skipping insertion in model container [2023-11-28 23:42:55,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:55" (3/3) ... [2023-11-28 23:42:55,852 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_eq_harness.i [2023-11-28 23:42:55,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:42:55,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 23:42:55,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:42:55,931 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66b31762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:42:55,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 23:42:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-28 23:42:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-28 23:42:55,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:42:55,951 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:55,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:42:55,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1816934940, now seen corresponding path program 1 times [2023-11-28 23:42:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919100694] [2023-11-28 23:42:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:42:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:42:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:42:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:42:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:42:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-28 23:42:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 23:42:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-28 23:42:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 23:42:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 23:42:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 23:42:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 23:42:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 23:42:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:42:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:42:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:42:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 23:42:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-28 23:42:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:42:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919100694] [2023-11-28 23:42:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919100694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:56,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:42:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064493770] [2023-11-28 23:42:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:56,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:42:56,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:42:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:42:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:42:56,789 INFO L87 Difference]: Start difference. First operand has 122 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-28 23:42:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:42:57,967 INFO L93 Difference]: Finished difference Result 244 states and 362 transitions. [2023-11-28 23:42:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:42:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 93 [2023-11-28 23:42:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:42:57,981 INFO L225 Difference]: With dead ends: 244 [2023-11-28 23:42:57,981 INFO L226 Difference]: Without dead ends: 122 [2023-11-28 23:42:57,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:42:57,990 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 98 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:42:57,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 154 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 23:42:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-28 23:42:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2023-11-28 23:42:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-28 23:42:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2023-11-28 23:42:58,046 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 93 [2023-11-28 23:42:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:42:58,047 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2023-11-28 23:42:58,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-28 23:42:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2023-11-28 23:42:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-28 23:42:58,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:42:58,054 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:58,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:42:58,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:42:58,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1600628444, now seen corresponding path program 1 times [2023-11-28 23:42:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151440659] [2023-11-28 23:42:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:42:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:42:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:42:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:42:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:42:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-28 23:42:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 23:42:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-28 23:42:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 23:42:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 23:42:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 23:42:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 23:42:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 23:42:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:42:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:42:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:42:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 23:42:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 23:42:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:42:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151440659] [2023-11-28 23:42:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151440659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:42:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824394836] [2023-11-28 23:42:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:42:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:42:58,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:42:58,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 23:42:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:59,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:42:59,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-28 23:42:59,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:59,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824394836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:59,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:42:59,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-28 23:42:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264759817] [2023-11-28 23:42:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:42:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:42:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:42:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:42:59,533 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-28 23:43:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:43:00,080 INFO L93 Difference]: Finished difference Result 234 states and 323 transitions. [2023-11-28 23:43:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:43:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 93 [2023-11-28 23:43:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:43:00,084 INFO L225 Difference]: With dead ends: 234 [2023-11-28 23:43:00,084 INFO L226 Difference]: Without dead ends: 121 [2023-11-28 23:43:00,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:43:00,087 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 43 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:43:00,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 469 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 23:43:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-28 23:43:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-28 23:43:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 70 states have internal predecessors, (84), 40 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (45), 39 states have call predecessors, (45), 39 states have call successors, (45) [2023-11-28 23:43:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2023-11-28 23:43:00,110 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 93 [2023-11-28 23:43:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:43:00,111 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2023-11-28 23:43:00,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-28 23:43:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2023-11-28 23:43:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-28 23:43:00,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:43:00,114 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:00,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:43:00,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:00,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:43:00,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1736790185, now seen corresponding path program 1 times [2023-11-28 23:43:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:43:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278194611] [2023-11-28 23:43:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:43:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:00,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:43:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:43:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:43:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:43:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:43:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:43:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:43:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:43:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 23:43:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 23:43:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 23:43:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 23:43:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:43:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 23:43:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 23:43:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:43:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278194611] [2023-11-28 23:43:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278194611] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:43:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470280937] [2023-11-28 23:43:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:01,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:43:01,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:43:01,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 23:43:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:43:01,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-28 23:43:01,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470280937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:43:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-28 23:43:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019772216] [2023-11-28 23:43:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:01,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:43:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:43:01,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:43:01,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-28 23:43:01,846 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 23:43:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:43:02,982 INFO L93 Difference]: Finished difference Result 198 states and 276 transitions. [2023-11-28 23:43:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:43:02,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 95 [2023-11-28 23:43:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:43:02,985 INFO L225 Difference]: With dead ends: 198 [2023-11-28 23:43:02,985 INFO L226 Difference]: Without dead ends: 121 [2023-11-28 23:43:02,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-28 23:43:02,987 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 43 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:43:02,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 600 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 23:43:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-28 23:43:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-28 23:43:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 70 states have internal predecessors, (84), 40 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2023-11-28 23:43:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2023-11-28 23:43:03,008 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 95 [2023-11-28 23:43:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:43:03,009 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2023-11-28 23:43:03,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 23:43:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2023-11-28 23:43:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-28 23:43:03,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:43:03,012 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:03,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 23:43:03,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:03,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:43:03,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 344886413, now seen corresponding path program 2 times [2023-11-28 23:43:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:43:03,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943810147] [2023-11-28 23:43:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:43:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:43:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:43:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:43:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:43:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:43:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:43:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:43:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:43:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:43:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:43:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-28 23:43:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-28 23:43:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:43:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 23:43:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-28 23:43:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:43:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943810147] [2023-11-28 23:43:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943810147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:43:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020463858] [2023-11-28 23:43:04,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:43:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:43:04,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:43:04,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 23:43:04,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:43:04,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:43:04,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 2302 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 23:43:04,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-28 23:43:04,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020463858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:04,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:43:04,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-11-28 23:43:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103202383] [2023-11-28 23:43:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:04,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:43:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:43:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:43:04,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:43:04,669 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 8 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-28 23:43:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:43:06,395 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2023-11-28 23:43:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:43:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 99 [2023-11-28 23:43:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:43:06,398 INFO L225 Difference]: With dead ends: 132 [2023-11-28 23:43:06,399 INFO L226 Difference]: Without dead ends: 130 [2023-11-28 23:43:06,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-28 23:43:06,400 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 17 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:43:06,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1044 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 23:43:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-28 23:43:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-11-28 23:43:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 76 states have internal predecessors, (89), 41 states have call successors, (41), 12 states have call predecessors, (41), 14 states have return successors, (52), 40 states have call predecessors, (52), 40 states have call successors, (52) [2023-11-28 23:43:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2023-11-28 23:43:06,419 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 99 [2023-11-28 23:43:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:43:06,420 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2023-11-28 23:43:06,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-28 23:43:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2023-11-28 23:43:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-28 23:43:06,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:43:06,422 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:06,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 23:43:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:06,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:43:06,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1982036155, now seen corresponding path program 1 times [2023-11-28 23:43:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:43:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023523499] [2023-11-28 23:43:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:43:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:43:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:43:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:43:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:43:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:43:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:43:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:43:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:43:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:43:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:43:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-28 23:43:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-28 23:43:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:43:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 23:43:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-28 23:43:07,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:43:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023523499] [2023-11-28 23:43:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023523499] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:43:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229708104] [2023-11-28 23:43:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:43:07,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:43:07,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 23:43:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:07,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:43:07,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-28 23:43:07,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229708104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:07,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:43:07,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-28 23:43:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557067954] [2023-11-28 23:43:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:07,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:43:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:43:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:43:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-28 23:43:07,976 INFO L87 Difference]: Start difference. First operand 129 states and 182 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 23:43:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:43:08,723 INFO L93 Difference]: Finished difference Result 228 states and 320 transitions. [2023-11-28 23:43:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:43:08,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 103 [2023-11-28 23:43:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:43:08,726 INFO L225 Difference]: With dead ends: 228 [2023-11-28 23:43:08,726 INFO L226 Difference]: Without dead ends: 127 [2023-11-28 23:43:08,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-28 23:43:08,727 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 42 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:43:08,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 495 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 23:43:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-28 23:43:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-28 23:43:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2023-11-28 23:43:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 176 transitions. [2023-11-28 23:43:08,746 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 176 transitions. Word has length 103 [2023-11-28 23:43:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:43:08,746 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 176 transitions. [2023-11-28 23:43:08,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 23:43:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 176 transitions. [2023-11-28 23:43:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-28 23:43:08,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:43:08,748 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:08,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 23:43:08,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:08,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:43:08,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2035474218, now seen corresponding path program 1 times [2023-11-28 23:43:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:43:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324015253] [2023-11-28 23:43:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:43:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:43:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:43:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:43:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:43:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:43:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:43:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:43:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:43:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:43:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:43:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:43:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 23:43:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:43:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:43:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 23:43:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-28 23:43:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:43:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324015253] [2023-11-28 23:43:11,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324015253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:43:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716845409] [2023-11-28 23:43:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:11,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:43:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:43:11,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:43:11,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 23:43:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:12,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-28 23:43:12,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:12,337 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-28 23:43:12,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-11-28 23:43:14,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-28 23:43:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 42 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-28 23:43:14,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:43:15,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716845409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:43:15,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:43:15,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-11-28 23:43:15,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059469055] [2023-11-28 23:43:15,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:43:15,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 23:43:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:43:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 23:43:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2023-11-28 23:43:15,014 INFO L87 Difference]: Start difference. First operand 127 states and 176 transitions. Second operand has 26 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 14 states have call successors, (34), 6 states have call predecessors, (34), 7 states have return successors, (33), 11 states have call predecessors, (33), 14 states have call successors, (33) [2023-11-28 23:43:19,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:21,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:24,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:25,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:27,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:29,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:30,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:36,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:38,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:40,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:41,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:45,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:48,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:49,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:50,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:52,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:53,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:56,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:57,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:43:59,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:01,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:02,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:05,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:06,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:07,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:14,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:15,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:20,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:24,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:26,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:27,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:29,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:33,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:35,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:36,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:38,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:40,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:42,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:44,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:45,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:52,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:54,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:55,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:57,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:44:58,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:05,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:06,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:08,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:09,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:10,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:12,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:13,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:14,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:17,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:20,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:21,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:23,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:24,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:28,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:32,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:33,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:34,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:36,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:40,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:44,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:46,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:47,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:49,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:50,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:52,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:54,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:56,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:58,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:45:59,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:01,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:02,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:03,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:04,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:06,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:09,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:13,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:14,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:15,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:16,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:18,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:19,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:21,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:22,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:46:22,655 INFO L93 Difference]: Finished difference Result 469 states and 656 transitions. [2023-11-28 23:46:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-28 23:46:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 14 states have call successors, (34), 6 states have call predecessors, (34), 7 states have return successors, (33), 11 states have call predecessors, (33), 14 states have call successors, (33) Word has length 105 [2023-11-28 23:46:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:46:22,660 INFO L225 Difference]: With dead ends: 469 [2023-11-28 23:46:22,660 INFO L226 Difference]: Without dead ends: 384 [2023-11-28 23:46:22,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 189 SyntacticMatches, 15 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=553, Invalid=3720, Unknown=17, NotChecked=0, Total=4290 [2023-11-28 23:46:22,664 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 570 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 519 mSolverCounterUnsat, 142 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 142 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:46:22,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 582 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2596 Invalid, 142 Unknown, 0 Unchecked, 164.8s Time] [2023-11-28 23:46:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-11-28 23:46:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 347. [2023-11-28 23:46:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 200 states have (on average 1.19) internal successors, (238), 202 states have internal predecessors, (238), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (126), 110 states have call predecessors, (126), 110 states have call successors, (126) [2023-11-28 23:46:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 477 transitions. [2023-11-28 23:46:22,735 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 477 transitions. Word has length 105 [2023-11-28 23:46:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:46:22,736 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 477 transitions. [2023-11-28 23:46:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 14 states have call successors, (34), 6 states have call predecessors, (34), 7 states have return successors, (33), 11 states have call predecessors, (33), 14 states have call successors, (33) [2023-11-28 23:46:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions. [2023-11-28 23:46:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-28 23:46:22,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:46:22,739 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:46:22,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-28 23:46:22,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:46:22,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:46:22,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:46:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash -362381670, now seen corresponding path program 2 times [2023-11-28 23:46:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:46:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918936138] [2023-11-28 23:46:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:46:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:46:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:46:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:46:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:46:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:46:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:46:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 23:46:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 23:46:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 23:46:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 23:46:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-28 23:46:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-28 23:46:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-28 23:46:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-28 23:46:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 23:46:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:46:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:46:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 23:46:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:46:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-28 23:46:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:46:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918936138] [2023-11-28 23:46:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918936138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:46:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046040127] [2023-11-28 23:46:24,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:46:24,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:46:24,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:46:24,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:46:24,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-28 23:46:24,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:46:24,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:46:24,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 2706 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-28 23:46:24,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:46:25,079 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:46:25,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2023-11-28 23:46:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 80 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-28 23:46:25,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:46:26,364 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-28 23:46:26,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 19 [2023-11-28 23:46:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 23:46:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046040127] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:46:26,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:46:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 30 [2023-11-28 23:46:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782672959] [2023-11-28 23:46:26,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:46:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-28 23:46:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:46:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-28 23:46:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2023-11-28 23:46:26,388 INFO L87 Difference]: Start difference. First operand 347 states and 477 transitions. Second operand has 30 states, 27 states have (on average 4.148148148148148) internal successors, (112), 27 states have internal predecessors, (112), 11 states have call successors, (42), 5 states have call predecessors, (42), 8 states have return successors, (41), 10 states have call predecessors, (41), 11 states have call successors, (41) [2023-11-28 23:46:34,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:39,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:44,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:48,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:52,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:46:56,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:47:00,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:47:04,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:47:08,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:47:14,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:47:19,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:47:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:47:22,294 INFO L93 Difference]: Finished difference Result 766 states and 1082 transitions. [2023-11-28 23:47:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-28 23:47:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.148148148148148) internal successors, (112), 27 states have internal predecessors, (112), 11 states have call successors, (42), 5 states have call predecessors, (42), 8 states have return successors, (41), 10 states have call predecessors, (41), 11 states have call successors, (41) Word has length 113 [2023-11-28 23:47:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:47:22,300 INFO L225 Difference]: With dead ends: 766 [2023-11-28 23:47:22,300 INFO L226 Difference]: Without dead ends: 528 [2023-11-28 23:47:22,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 232 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=560, Invalid=3730, Unknown=0, NotChecked=0, Total=4290 [2023-11-28 23:47:22,304 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 435 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 4467 mSolverCounterSat, 402 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 4467 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.4s IncrementalHoareTripleChecker+Time [2023-11-28 23:47:22,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1565 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 4467 Invalid, 45 Unknown, 0 Unchecked, 53.4s Time] [2023-11-28 23:47:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-11-28 23:47:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 486. [2023-11-28 23:47:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 285 states have (on average 1.1859649122807017) internal successors, (338), 288 states have internal predecessors, (338), 156 states have call successors, (156), 46 states have call predecessors, (156), 44 states have return successors, (169), 151 states have call predecessors, (169), 152 states have call successors, (169) [2023-11-28 23:47:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 663 transitions. [2023-11-28 23:47:22,401 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 663 transitions. Word has length 113 [2023-11-28 23:47:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:47:22,401 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 663 transitions. [2023-11-28 23:47:22,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.148148148148148) internal successors, (112), 27 states have internal predecessors, (112), 11 states have call successors, (42), 5 states have call predecessors, (42), 8 states have return successors, (41), 10 states have call predecessors, (41), 11 states have call successors, (41) [2023-11-28 23:47:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 663 transitions. [2023-11-28 23:47:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-28 23:47:22,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:47:22,405 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:47:22,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-28 23:47:22,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:47:22,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:47:22,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:47:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -181770134, now seen corresponding path program 1 times [2023-11-28 23:47:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:47:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745295859] [2023-11-28 23:47:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:47:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:47:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:47:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:47:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:47:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:47:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:47:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:47:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:47:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:47:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:47:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:47:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:47:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 23:47:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:47:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-28 23:47:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 23:47:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:47:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-28 23:47:23,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:47:23,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745295859] [2023-11-28 23:47:23,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745295859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:47:23,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:47:23,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 23:47:23,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789905181] [2023-11-28 23:47:23,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:47:23,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 23:47:23,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:47:23,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:47:23,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:47:23,404 INFO L87 Difference]: Start difference. First operand 486 states and 663 transitions. Second operand has 10 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 23:47:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:47:25,875 INFO L93 Difference]: Finished difference Result 505 states and 687 transitions. [2023-11-28 23:47:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:47:25,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2023-11-28 23:47:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:47:25,880 INFO L225 Difference]: With dead ends: 505 [2023-11-28 23:47:25,880 INFO L226 Difference]: Without dead ends: 503 [2023-11-28 23:47:25,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-28 23:47:25,881 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 117 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:47:25,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 521 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-28 23:47:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-11-28 23:47:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 495. [2023-11-28 23:47:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 291 states have (on average 1.1821305841924399) internal successors, (344), 294 states have internal predecessors, (344), 157 states have call successors, (157), 48 states have call predecessors, (157), 46 states have return successors, (170), 152 states have call predecessors, (170), 153 states have call successors, (170) [2023-11-28 23:47:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 671 transitions. [2023-11-28 23:47:25,969 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 671 transitions. Word has length 115 [2023-11-28 23:47:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:47:25,970 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 671 transitions. [2023-11-28 23:47:25,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 23:47:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 671 transitions. [2023-11-28 23:47:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-28 23:47:25,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:47:25,974 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:47:25,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:47:25,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:47:25,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:47:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -330940995, now seen corresponding path program 1 times [2023-11-28 23:47:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:47:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581978816] [2023-11-28 23:47:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:47:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:47:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:47:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:47:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:47:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:47:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:47:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:47:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:47:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-28 23:47:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 23:47:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 23:47:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 23:47:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 23:47:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:47:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:47:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-28 23:47:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:47:27,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581978816] [2023-11-28 23:47:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581978816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:47:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625959117] [2023-11-28 23:47:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:47:27,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:47:27,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:47:27,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:47:27,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-28 23:47:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:27,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 2723 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:47:27,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:47:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-28 23:47:27,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:47:27,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625959117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:47:27,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:47:27,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-11-28 23:47:27,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016783108] [2023-11-28 23:47:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:47:27,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:47:27,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:47:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:47:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:47:27,664 INFO L87 Difference]: Start difference. First operand 495 states and 671 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-28 23:47:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:47:29,301 INFO L93 Difference]: Finished difference Result 861 states and 1203 transitions. [2023-11-28 23:47:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:47:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 119 [2023-11-28 23:47:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:47:29,306 INFO L225 Difference]: With dead ends: 861 [2023-11-28 23:47:29,306 INFO L226 Difference]: Without dead ends: 495 [2023-11-28 23:47:29,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-28 23:47:29,309 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 18 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:47:29,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 544 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-28 23:47:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-11-28 23:47:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2023-11-28 23:47:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 291 states have (on average 1.168384879725086) internal successors, (340), 294 states have internal predecessors, (340), 157 states have call successors, (157), 48 states have call predecessors, (157), 46 states have return successors, (170), 152 states have call predecessors, (170), 153 states have call successors, (170) [2023-11-28 23:47:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 667 transitions. [2023-11-28 23:47:29,390 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 667 transitions. Word has length 119 [2023-11-28 23:47:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:47:29,390 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 667 transitions. [2023-11-28 23:47:29,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-28 23:47:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 667 transitions. [2023-11-28 23:47:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-28 23:47:29,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:47:29,392 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:47:29,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-28 23:47:29,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:47:29,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:47:29,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:47:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1949915909, now seen corresponding path program 1 times [2023-11-28 23:47:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:47:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042429697] [2023-11-28 23:47:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:47:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:47:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:47:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:47:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:47:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:47:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:47:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:47:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:47:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-28 23:47:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 23:47:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 23:47:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 23:47:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 23:47:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:47:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:47:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-28 23:47:30,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:47:30,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042429697] [2023-11-28 23:47:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042429697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:47:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724040231] [2023-11-28 23:47:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:47:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:47:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:47:30,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:47:30,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-28 23:47:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:30,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-28 23:47:30,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:47:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-28 23:47:30,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:47:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724040231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:47:30,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:47:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2023-11-28 23:47:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414038016] [2023-11-28 23:47:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:47:30,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:47:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:47:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:47:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-28 23:47:30,950 INFO L87 Difference]: Start difference. First operand 495 states and 667 transitions. Second operand has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-28 23:47:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:47:32,317 INFO L93 Difference]: Finished difference Result 761 states and 1046 transitions. [2023-11-28 23:47:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:47:32,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 119 [2023-11-28 23:47:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:47:32,322 INFO L225 Difference]: With dead ends: 761 [2023-11-28 23:47:32,322 INFO L226 Difference]: Without dead ends: 507 [2023-11-28 23:47:32,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-28 23:47:32,324 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 12 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:47:32,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1119 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 23:47:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-11-28 23:47:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2023-11-28 23:47:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 297 states have (on average 1.164983164983165) internal successors, (346), 302 states have internal predecessors, (346), 157 states have call successors, (157), 48 states have call predecessors, (157), 48 states have return successors, (189), 152 states have call predecessors, (189), 153 states have call successors, (189) [2023-11-28 23:47:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 692 transitions. [2023-11-28 23:47:32,386 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 692 transitions. Word has length 119 [2023-11-28 23:47:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:47:32,386 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 692 transitions. [2023-11-28 23:47:32,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-28 23:47:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 692 transitions. [2023-11-28 23:47:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-28 23:47:32,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:47:32,388 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:47:32,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-28 23:47:32,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:47:32,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:47:32,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:47:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash 815225748, now seen corresponding path program 2 times [2023-11-28 23:47:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:47:32,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602148205] [2023-11-28 23:47:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:47:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:47:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:47:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:47:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:47:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:47:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:47:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:47:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:47:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-28 23:47:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-28 23:47:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 23:47:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 23:47:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 23:47:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:47:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:47:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 23:47:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:47:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-28 23:47:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:47:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602148205] [2023-11-28 23:47:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602148205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:47:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640859687] [2023-11-28 23:47:33,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:47:33,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:47:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:47:33,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:47:33,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-28 23:47:33,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:47:33,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:47:33,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-28 23:47:33,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:47:33,855 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-28 23:47:33,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-28 23:47:37,962 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_29|) 0) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_35|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_35| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_29|)))) is different from true [2023-11-28 23:47:42,060 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_30| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_36| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_30|)) (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_30|) 0) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_36|) 0)))) is different from true [2023-11-28 23:47:46,147 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10|) 0) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_18|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_18| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10|)))) is different from true [2023-11-28 23:47:50,240 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11| Int)) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_19|) 0) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_19| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11|)))) is different from true [2023-11-28 23:47:54,316 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12|) 0) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_20|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_20| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12|)))) is different from true [2023-11-28 23:47:58,412 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_21| Int)) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13|) 0) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_21|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_21| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13|)))) is different from true [2023-11-28 23:47:58,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-28 23:47:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 0 refuted. 16 times theorem prover too weak. 26 trivial. 18 not checked. [2023-11-28 23:47:58,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:47:58,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 23:47:58,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 54 [2023-11-28 23:47:58,839 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2023-11-28 23:47:58,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2023-11-28 23:47:58,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:47:58,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 23:47:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-28 23:47:58,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640859687] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-28 23:47:58,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:47:58,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 15] total 29 [2023-11-28 23:47:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370892668] [2023-11-28 23:47:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:47:58,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:47:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:47:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:47:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=457, Unknown=6, NotChecked=282, Total=812 [2023-11-28 23:47:58,938 INFO L87 Difference]: Start difference. First operand 503 states and 692 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2023-11-28 23:48:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:48:00,410 INFO L93 Difference]: Finished difference Result 600 states and 823 transitions. [2023-11-28 23:48:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:48:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 121 [2023-11-28 23:48:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:48:00,416 INFO L225 Difference]: With dead ends: 600 [2023-11-28 23:48:00,416 INFO L226 Difference]: Without dead ends: 518 [2023-11-28 23:48:00,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 249 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=87, Invalid=581, Unknown=6, NotChecked=318, Total=992 [2023-11-28 23:48:00,418 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 87 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:48:00,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 659 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-28 23:48:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-11-28 23:48:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 505. [2023-11-28 23:48:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 298 states have (on average 1.1644295302013423) internal successors, (347), 304 states have internal predecessors, (347), 157 states have call successors, (157), 48 states have call predecessors, (157), 49 states have return successors, (191), 152 states have call predecessors, (191), 153 states have call successors, (191) [2023-11-28 23:48:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 695 transitions. [2023-11-28 23:48:00,515 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 695 transitions. Word has length 121 [2023-11-28 23:48:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:48:00,515 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 695 transitions. [2023-11-28 23:48:00,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2023-11-28 23:48:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 695 transitions. [2023-11-28 23:48:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-28 23:48:00,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:48:00,517 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:48:00,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-28 23:48:00,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:48:00,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:48:00,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:48:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1747261342, now seen corresponding path program 1 times [2023-11-28 23:48:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:48:00,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877290669] [2023-11-28 23:48:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:48:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:48:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:48:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:48:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:48:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:48:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:48:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:48:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:48:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:48:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:48:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-28 23:48:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-28 23:48:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 23:48:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 23:48:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 23:48:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:48:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:48:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 23:48:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-28 23:48:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:48:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877290669] [2023-11-28 23:48:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877290669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:48:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579583870] [2023-11-28 23:48:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:48:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:48:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:48:01,596 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:48:01,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-28 23:48:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:02,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-28 23:48:02,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:48:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-28 23:48:02,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:48:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579583870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:48:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:48:02,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2023-11-28 23:48:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120254809] [2023-11-28 23:48:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:48:02,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:48:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:48:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:48:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-28 23:48:02,102 INFO L87 Difference]: Start difference. First operand 505 states and 695 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-28 23:48:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:48:03,848 INFO L93 Difference]: Finished difference Result 771 states and 1058 transitions. [2023-11-28 23:48:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:48:03,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 122 [2023-11-28 23:48:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:48:03,852 INFO L225 Difference]: With dead ends: 771 [2023-11-28 23:48:03,853 INFO L226 Difference]: Without dead ends: 509 [2023-11-28 23:48:03,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-28 23:48:03,854 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:48:03,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1111 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 23:48:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-11-28 23:48:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 505. [2023-11-28 23:48:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 298 states have (on average 1.1644295302013423) internal successors, (347), 304 states have internal predecessors, (347), 157 states have call successors, (157), 48 states have call predecessors, (157), 49 states have return successors, (185), 152 states have call predecessors, (185), 153 states have call successors, (185) [2023-11-28 23:48:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 689 transitions. [2023-11-28 23:48:03,941 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 689 transitions. Word has length 122 [2023-11-28 23:48:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:48:03,941 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 689 transitions. [2023-11-28 23:48:03,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-28 23:48:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 689 transitions. [2023-11-28 23:48:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-28 23:48:03,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:48:03,944 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:48:03,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-28 23:48:04,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-28 23:48:04,144 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:48:04,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:48:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash -445942473, now seen corresponding path program 2 times [2023-11-28 23:48:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:48:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137174313] [2023-11-28 23:48:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:48:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:48:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:48:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:48:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:48:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:48:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:48:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:48:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:48:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:48:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:48:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-28 23:48:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-28 23:48:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 23:48:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 23:48:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 23:48:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:48:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:48:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 23:48:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:48:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-28 23:48:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:48:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137174313] [2023-11-28 23:48:05,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137174313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:48:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546175460] [2023-11-28 23:48:05,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:48:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:48:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:48:05,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:48:05,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-28 23:48:05,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:48:05,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:48:05,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 2751 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-28 23:48:05,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:48:06,025 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-28 23:48:06,436 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:48:06,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2023-11-28 23:48:07,583 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-28 23:48:07,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 20 [2023-11-28 23:48:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 46 proven. 46 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-28 23:48:07,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:48:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-28 23:48:08,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546175460] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:48:08,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:48:08,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12] total 28 [2023-11-28 23:48:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41062237] [2023-11-28 23:48:08,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:48:08,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-28 23:48:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:48:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-28 23:48:08,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2023-11-28 23:48:08,205 INFO L87 Difference]: Start difference. First operand 505 states and 689 transitions. Second operand has 28 states, 25 states have (on average 4.56) internal successors, (114), 26 states have internal predecessors, (114), 15 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (41), 12 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-28 23:48:12,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:20,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:24,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:28,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:32,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:37,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:41,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:45,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:49,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:54,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:48:59,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:49:02,620 INFO L93 Difference]: Finished difference Result 770 states and 1050 transitions. [2023-11-28 23:49:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-28 23:49:02,621 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.56) internal successors, (114), 26 states have internal predecessors, (114), 15 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (41), 12 states have call predecessors, (41), 15 states have call successors, (41) Word has length 124 [2023-11-28 23:49:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:49:02,624 INFO L225 Difference]: With dead ends: 770 [2023-11-28 23:49:02,624 INFO L226 Difference]: Without dead ends: 540 [2023-11-28 23:49:02,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 262 SyntacticMatches, 23 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=454, Invalid=3443, Unknown=9, NotChecked=0, Total=3906 [2023-11-28 23:49:02,627 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 353 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 3987 mSolverCounterSat, 286 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 4339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 3987 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:49:02,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1365 Invalid, 4339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 3987 Invalid, 66 Unknown, 0 Unchecked, 52.1s Time] [2023-11-28 23:49:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-11-28 23:49:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 507. [2023-11-28 23:49:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 299 states have (on average 1.160535117056856) internal successors, (347), 306 states have internal predecessors, (347), 157 states have call successors, (157), 48 states have call predecessors, (157), 50 states have return successors, (187), 152 states have call predecessors, (187), 153 states have call successors, (187) [2023-11-28 23:49:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 691 transitions. [2023-11-28 23:49:02,730 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 691 transitions. Word has length 124 [2023-11-28 23:49:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:49:02,730 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 691 transitions. [2023-11-28 23:49:02,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.56) internal successors, (114), 26 states have internal predecessors, (114), 15 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (41), 12 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-28 23:49:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 691 transitions. [2023-11-28 23:49:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-28 23:49:02,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:49:02,732 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:49:02,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-28 23:49:02,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-28 23:49:02,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:49:02,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:49:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1290414344, now seen corresponding path program 1 times [2023-11-28 23:49:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:49:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421353176] [2023-11-28 23:49:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:49:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:49:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:49:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:04,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:49:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:49:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:49:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:04,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:49:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:49:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:49:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:49:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:49:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-28 23:49:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-28 23:49:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 23:49:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 23:49:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 23:49:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:49:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:49:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 23:49:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-28 23:49:05,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:49:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421353176] [2023-11-28 23:49:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421353176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:49:05,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066776898] [2023-11-28 23:49:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:49:05,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:49:05,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:49:05,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:49:05,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-28 23:49:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:49:05,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-28 23:49:05,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:49:05,783 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-28 23:49:06,183 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-11-28 23:49:06,188 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-11-28 23:49:06,193 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-28 23:49:06,197 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-28 23:49:06,209 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:49:06,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2023-11-28 23:49:06,413 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-28 23:49:06,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 13 [2023-11-28 23:49:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-28 23:49:07,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:49:12,494 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-11-28 23:49:12,822 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 5 [2023-11-28 23:49:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 14 proven. 40 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-28 23:49:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066776898] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:49:12,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:49:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 18] total 50 [2023-11-28 23:49:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14569278] [2023-11-28 23:49:12,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:49:12,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-28 23:49:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:49:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-28 23:49:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2244, Unknown=1, NotChecked=0, Total=2450 [2023-11-28 23:49:12,870 INFO L87 Difference]: Start difference. First operand 507 states and 691 transitions. Second operand has 50 states, 45 states have (on average 3.688888888888889) internal successors, (166), 44 states have internal predecessors, (166), 17 states have call successors, (47), 7 states have call predecessors, (47), 13 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2023-11-28 23:49:19,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:25,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:32,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:36,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:40,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:45,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:49,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:53,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:49:57,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:02,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:06,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:10,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:15,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:19,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:24,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:33,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:38,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:42,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:46,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:50,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:50:54,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:51:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:01,865 INFO L93 Difference]: Finished difference Result 1407 states and 1887 transitions. [2023-11-28 23:51:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-11-28 23:51:01,866 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 3.688888888888889) internal successors, (166), 44 states have internal predecessors, (166), 17 states have call successors, (47), 7 states have call predecessors, (47), 13 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) Word has length 124 [2023-11-28 23:51:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:01,871 INFO L225 Difference]: With dead ends: 1407 [2023-11-28 23:51:01,871 INFO L226 Difference]: Without dead ends: 923 [2023-11-28 23:51:01,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 251 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6747 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=2868, Invalid=19774, Unknown=8, NotChecked=0, Total=22650 [2023-11-28 23:51:01,879 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1348 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 10016 mSolverCounterSat, 1158 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 11226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1158 IncrementalHoareTripleChecker+Valid, 10016 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:01,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 2216 Invalid, 11226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1158 Valid, 10016 Invalid, 52 Unknown, 0 Unchecked, 98.6s Time] [2023-11-28 23:51:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-11-28 23:51:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 748. [2023-11-28 23:51:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 450 states have (on average 1.1688888888888889) internal successors, (526), 463 states have internal predecessors, (526), 219 states have call successors, (219), 71 states have call predecessors, (219), 78 states have return successors, (262), 213 states have call predecessors, (262), 212 states have call successors, (262) [2023-11-28 23:51:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1007 transitions. [2023-11-28 23:51:02,011 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1007 transitions. Word has length 124 [2023-11-28 23:51:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:02,012 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1007 transitions. [2023-11-28 23:51:02,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 3.688888888888889) internal successors, (166), 44 states have internal predecessors, (166), 17 states have call successors, (47), 7 states have call predecessors, (47), 13 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2023-11-28 23:51:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1007 transitions. [2023-11-28 23:51:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-28 23:51:02,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:02,015 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:51:02,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-28 23:51:02,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-28 23:51:02,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:51:02,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1960650831, now seen corresponding path program 1 times [2023-11-28 23:51:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:51:02,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871591785] [2023-11-28 23:51:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:51:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:03,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:51:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:51:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:51:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:51:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:51:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:51:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:51:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:51:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:51:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:51:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:51:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 23:51:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:51:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-28 23:51:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 23:51:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:51:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-28 23:51:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-28 23:51:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:51:04,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871591785] [2023-11-28 23:51:04,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871591785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:04,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 23:51:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971902726] [2023-11-28 23:51:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:04,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 23:51:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:51:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:51:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:51:04,181 INFO L87 Difference]: Start difference. First operand 748 states and 1007 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 5 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-28 23:51:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:06,071 INFO L93 Difference]: Finished difference Result 775 states and 1042 transitions. [2023-11-28 23:51:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:51:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 5 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 122 [2023-11-28 23:51:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:06,076 INFO L225 Difference]: With dead ends: 775 [2023-11-28 23:51:06,076 INFO L226 Difference]: Without dead ends: 773 [2023-11-28 23:51:06,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-11-28 23:51:06,077 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 173 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:06,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 326 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 23:51:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-11-28 23:51:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 756. [2023-11-28 23:51:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 456 states have (on average 1.1666666666666667) internal successors, (532), 469 states have internal predecessors, (532), 219 states have call successors, (219), 73 states have call predecessors, (219), 80 states have return successors, (262), 213 states have call predecessors, (262), 212 states have call successors, (262) [2023-11-28 23:51:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1013 transitions. [2023-11-28 23:51:06,302 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1013 transitions. Word has length 122 [2023-11-28 23:51:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:06,302 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1013 transitions. [2023-11-28 23:51:06,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 5 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-28 23:51:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1013 transitions. [2023-11-28 23:51:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 23:51:06,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:06,306 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:51:06,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 23:51:06,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:51:06,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1099769098, now seen corresponding path program 1 times [2023-11-28 23:51:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:51:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808075110] [2023-11-28 23:51:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:51:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:51:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:51:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:51:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:51:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:51:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:51:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:51:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:51:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:51:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:51:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:51:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 23:51:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:51:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-28 23:51:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 23:51:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:51:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-28 23:51:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-28 23:51:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-11-28 23:51:06,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:51:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808075110] [2023-11-28 23:51:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808075110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:51:06,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816964279] [2023-11-28 23:51:06,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:06,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:51:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:51:06,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:51:06,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:51:06,800 INFO L87 Difference]: Start difference. First operand 756 states and 1013 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-28 23:51:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:08,409 INFO L93 Difference]: Finished difference Result 1020 states and 1361 transitions. [2023-11-28 23:51:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:51:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2023-11-28 23:51:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:08,425 INFO L225 Difference]: With dead ends: 1020 [2023-11-28 23:51:08,425 INFO L226 Difference]: Without dead ends: 800 [2023-11-28 23:51:08,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:51:08,426 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 96 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:08,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 398 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-28 23:51:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2023-11-28 23:51:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2023-11-28 23:51:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 474 states have (on average 1.160337552742616) internal successors, (550), 485 states have internal predecessors, (550), 237 states have call successors, (237), 73 states have call predecessors, (237), 82 states have return successors, (290), 235 states have call predecessors, (290), 230 states have call successors, (290) [2023-11-28 23:51:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1077 transitions. [2023-11-28 23:51:08,564 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1077 transitions. Word has length 129 [2023-11-28 23:51:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:08,564 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1077 transitions. [2023-11-28 23:51:08,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-28 23:51:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1077 transitions. [2023-11-28 23:51:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 23:51:08,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:08,567 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:51:08,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:51:08,567 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:51:08,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1382655651, now seen corresponding path program 1 times [2023-11-28 23:51:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:51:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171381916] [2023-11-28 23:51:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:51:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:51:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:51:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:51:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:51:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:51:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:51:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:51:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:51:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:51:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:51:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:51:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 23:51:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:51:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-28 23:51:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 23:51:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:51:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-28 23:51:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-28 23:51:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-11-28 23:51:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:51:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171381916] [2023-11-28 23:51:10,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171381916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:10,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:10,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 23:51:10,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487792651] [2023-11-28 23:51:10,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:10,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:51:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:51:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:51:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:51:10,581 INFO L87 Difference]: Start difference. First operand 794 states and 1077 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-28 23:51:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:12,537 INFO L93 Difference]: Finished difference Result 825 states and 1116 transitions. [2023-11-28 23:51:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:51:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2023-11-28 23:51:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:12,542 INFO L225 Difference]: With dead ends: 825 [2023-11-28 23:51:12,542 INFO L226 Difference]: Without dead ends: 823 [2023-11-28 23:51:12,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-28 23:51:12,544 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 179 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:12,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 292 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 23:51:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2023-11-28 23:51:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 802. [2023-11-28 23:51:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 480 states have (on average 1.1583333333333334) internal successors, (556), 491 states have internal predecessors, (556), 237 states have call successors, (237), 75 states have call predecessors, (237), 84 states have return successors, (290), 235 states have call predecessors, (290), 230 states have call successors, (290) [2023-11-28 23:51:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1083 transitions. [2023-11-28 23:51:12,685 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1083 transitions. Word has length 129 [2023-11-28 23:51:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:12,686 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1083 transitions. [2023-11-28 23:51:12,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-28 23:51:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1083 transitions. [2023-11-28 23:51:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 23:51:12,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:12,688 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:51:12,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 23:51:12,689 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:51:12,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1223842345, now seen corresponding path program 1 times [2023-11-28 23:51:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:51:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066174082] [2023-11-28 23:51:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:51:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:51:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:51:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:51:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:51:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:51:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 23:51:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:51:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:51:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-28 23:51:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-28 23:51:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 23:51:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 23:51:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:51:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-28 23:51:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 23:51:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:51:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-28 23:51:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-28 23:51:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-11-28 23:51:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:51:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066174082] [2023-11-28 23:51:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066174082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:13,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:13,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 23:51:13,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689695109] [2023-11-28 23:51:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:13,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 23:51:13,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:51:13,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:51:13,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:51:13,306 INFO L87 Difference]: Start difference. First operand 802 states and 1083 transitions. Second operand has 10 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-28 23:51:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:15,671 INFO L93 Difference]: Finished difference Result 833 states and 1116 transitions. [2023-11-28 23:51:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:51:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2023-11-28 23:51:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:15,675 INFO L225 Difference]: With dead ends: 833 [2023-11-28 23:51:15,675 INFO L226 Difference]: Without dead ends: 831 [2023-11-28 23:51:15,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-28 23:51:15,677 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 114 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:15,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 521 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 23:51:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2023-11-28 23:51:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 822. [2023-11-28 23:51:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 495 states have (on average 1.1535353535353536) internal successors, (571), 506 states have internal predecessors, (571), 237 states have call successors, (237), 80 states have call predecessors, (237), 89 states have return successors, (290), 235 states have call predecessors, (290), 230 states have call successors, (290) [2023-11-28 23:51:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1098 transitions. [2023-11-28 23:51:15,843 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1098 transitions. Word has length 129 [2023-11-28 23:51:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:15,843 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1098 transitions. [2023-11-28 23:51:15,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-28 23:51:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1098 transitions. [2023-11-28 23:51:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-28 23:51:15,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:15,847 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:51:15,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 23:51:15,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:51:15,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1704971263, now seen corresponding path program 1 times [2023-11-28 23:51:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:51:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066552257] [2023-11-28 23:51:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:51:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:51:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:51:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 23:51:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 23:51:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 23:51:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 23:51:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-28 23:51:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-28 23:51:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:51:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 23:51:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 23:51:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 23:51:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-28 23:51:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-28 23:51:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:51:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:51:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-28 23:51:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-28 23:51:18,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:51:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066552257] [2023-11-28 23:51:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066552257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:51:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68162339] [2023-11-28 23:51:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:18,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:51:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:51:18,692 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:51:18,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-28 23:51:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:19,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 2833 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-28 23:51:19,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:51:19,214 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-28 23:51:19,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-28 23:51:19,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-11-28 23:51:19,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-11-28 23:51:24,056 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset_BEFORE_CALL_57| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_63| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_63|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_63| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_53|)) (= .cse0 (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_53|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset_BEFORE_CALL_57|))) (not (= .cse0 0))))) is different from true [2023-11-28 23:52:32,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:52:32,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 62 [2023-11-28 23:52:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 118 proven. 27 refuted. 0 times theorem prover too weak. 38 trivial. 1 not checked. [2023-11-28 23:52:33,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:52:41,873 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 29 [2023-11-28 23:52:41,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:52:41,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2023-11-28 23:52:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68162339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:52:46,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:52:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2023-11-28 23:52:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135560537] [2023-11-28 23:52:46,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:52:46,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-28 23:52:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:52:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-28 23:52:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2061, Unknown=26, NotChecked=92, Total=2352 [2023-11-28 23:52:46,088 INFO L87 Difference]: Start difference. First operand 822 states and 1098 transitions. Second operand has 42 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 33 states have internal predecessors, (131), 15 states have call successors, (41), 9 states have call predecessors, (41), 12 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2023-11-28 23:52:52,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:02,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:13,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:21,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:22,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:29,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:33,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:35,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:37,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:41,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:42,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:46,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:47,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:51,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:55,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:53:57,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:02,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:03,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:07,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:09,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:23,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:26,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:30,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:32,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:35,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:37,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:46,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:50,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:54:52,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:03,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:05,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:06,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:09,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:15,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:19,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:20,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:27,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:28,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:30,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:32,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:33,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:34,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:43,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:48,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:49,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:53,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:55:59,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:56:03,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:56:05,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:56:26,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:56:30,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:56:32,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 23:56:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:33,801 INFO L93 Difference]: Finished difference Result 1775 states and 2331 transitions. [2023-11-28 23:56:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-28 23:56:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 33 states have internal predecessors, (131), 15 states have call successors, (41), 9 states have call predecessors, (41), 12 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) Word has length 140 [2023-11-28 23:56:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:56:33,814 INFO L225 Difference]: With dead ends: 1775 [2023-11-28 23:56:33,814 INFO L226 Difference]: Without dead ends: 1660 [2023-11-28 23:56:33,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 239 SyntacticMatches, 11 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 172.7s TimeCoverageRelationStatistics Valid=946, Invalid=9515, Unknown=49, NotChecked=202, Total=10712 [2023-11-28 23:56:33,819 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 1002 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 9276 mSolverCounterSat, 1064 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 11205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1064 IncrementalHoareTripleChecker+Valid, 9276 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 775 IncrementalHoareTripleChecker+Unchecked, 140.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:56:33,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 2229 Invalid, 11205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1064 Valid, 9276 Invalid, 90 Unknown, 775 Unchecked, 140.8s Time] [2023-11-28 23:56:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2023-11-28 23:56:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1529. [2023-11-28 23:56:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 930 states have (on average 1.1397849462365592) internal successors, (1060), 947 states have internal predecessors, (1060), 428 states have call successors, (428), 151 states have call predecessors, (428), 170 states have return successors, (512), 430 states have call predecessors, (512), 415 states have call successors, (512) [2023-11-28 23:56:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2000 transitions. [2023-11-28 23:56:34,229 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2000 transitions. Word has length 140 [2023-11-28 23:56:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:56:34,229 INFO L495 AbstractCegarLoop]: Abstraction has 1529 states and 2000 transitions. [2023-11-28 23:56:34,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 33 states have internal predecessors, (131), 15 states have call successors, (41), 9 states have call predecessors, (41), 12 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2023-11-28 23:56:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2000 transitions. [2023-11-28 23:56:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-28 23:56:34,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:56:34,232 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:34,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:34,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:34,433 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:56:34,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash -326078463, now seen corresponding path program 1 times [2023-11-28 23:56:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964862263] [2023-11-28 23:56:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:56:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-28 23:56:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 23:56:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:56:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 23:56:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:56:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:56:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 23:56:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 23:56:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 23:56:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:56:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-28 23:56:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 23:56:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-28 23:56:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-28 23:56:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-28 23:56:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-28 23:56:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-28 23:56:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 23:56:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 23:56:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:56:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 23:56:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-28 23:56:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-11-28 23:56:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964862263] [2023-11-28 23:56:36,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964862263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102631025] [2023-11-28 23:56:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:36,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:36,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,609 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501e26bb-6345-4b96-8ade-a2bac9e7a956/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-28 23:56:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:37,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 2790 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-28 23:56:37,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:37,785 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616) 1))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (and (= (store |v_#memory_int#4_BEFORE_CALL_2| .cse1 (select |c_#memory_int#4| .cse1)) |c_#memory_int#4|) (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2))) (= .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|)))))) is different from false [2023-11-28 23:56:37,789 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616) 1))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (and (= (store |v_#memory_int#4_BEFORE_CALL_2| .cse1 (select |c_#memory_int#4| .cse1)) |c_#memory_int#4|) (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2))) (= .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|)))))) is different from true [2023-11-28 23:56:37,812 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) is different from false [2023-11-28 23:56:41,829 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) is different from true [2023-11-28 23:56:41,856 WARN L854 $PredicateComparison]: unable to prove that (and (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|))))) is different from false [2023-11-28 23:56:41,860 WARN L876 $PredicateComparison]: unable to prove that (and (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|))))) is different from true [2023-11-28 23:56:41,914 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) (let ((.cse3 (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0))) (or (and (not .cse3) (not |c_aws_byte_cursor_is_valid_#t~short700|)) (and |c_aws_byte_cursor_is_valid_#t~short700| .cse3)))) is different from false [2023-11-28 23:56:41,918 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) (let ((.cse3 (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0))) (or (and (not .cse3) (not |c_aws_byte_cursor_is_valid_#t~short700|)) (and |c_aws_byte_cursor_is_valid_#t~short700| .cse3)))) is different from true [2023-11-28 23:56:41,945 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0)) is different from false [2023-11-28 23:56:41,949 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0)) is different from true [2023-11-28 23:56:42,039 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) is different from false [2023-11-28 23:56:42,043 WARN L876 $PredicateComparison]: unable to prove that (and (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) is different from true [2023-11-28 23:56:42,075 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))))) is different from false [2023-11-28 23:56:42,997 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse1 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))))) is different from true [2023-11-28 23:56:43,102 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))))) is different from false [2023-11-28 23:56:43,107 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))))) is different from true [2023-11-28 23:56:43,224 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))))) is different from false [2023-11-28 23:56:44,040 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))))) is different from true [2023-11-28 23:56:44,172 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))))) is different from false [2023-11-28 23:56:44,177 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))))) is different from true [2023-11-28 23:56:44,231 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0))) (and (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1229#1| .cse2) (= (mod .cse2 18446744073709551616) 0)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))))) is different from false [2023-11-28 23:56:44,235 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0))) (and (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1229#1| .cse2) (= (mod .cse2 18446744073709551616) 0)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))))) is different from true [2023-11-28 23:56:44,272 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))))) is different from false [2023-11-28 23:56:45,352 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))))) is different from true [2023-11-28 23:56:45,507 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:45,514 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:56:45,585 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:45,590 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:56:45,647 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:46,369 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:56:46,837 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:46,844 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:56:46,911 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse7 (* 18446744073709551616 (div (* (- 1) .cse7) 18446744073709551616))))))) is different from false [2023-11-28 23:56:48,195 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse7 (* 18446744073709551616 (div (* (- 1) .cse7) 18446744073709551616))))))) is different from true [2023-11-28 23:56:48,397 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse8 (* 18446744073709551616 (div (* (- 1) .cse8) 18446744073709551616))))))) is different from false [2023-11-28 23:56:48,404 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse8 (* 18446744073709551616 (div (* (- 1) .cse8) 18446744073709551616))))))) is different from true [2023-11-28 23:56:48,551 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse8 (* 18446744073709551616 (div (* (- 1) .cse8) 18446744073709551616))))))) is different from false [2023-11-28 23:56:48,788 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse8 (* 18446744073709551616 (div (* (- 1) .cse8) 18446744073709551616))))))) is different from true [2023-11-28 23:56:49,087 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616))))) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse3 (* 18446744073709551616 (div (* .cse3 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse9 (* 18446744073709551616 (div (* (- 1) .cse9) 18446744073709551616))))))) is different from false [2023-11-28 23:56:49,092 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616))))) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse3 (* 18446744073709551616 (div (* .cse3 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse9 (* 18446744073709551616 (div (* (- 1) .cse9) 18446744073709551616))))))) is different from true [2023-11-28 23:56:49,210 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse3 (* 18446744073709551616 (div (* .cse3 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse9 (* 18446744073709551616 (div (* (- 1) .cse9) 18446744073709551616))))))) is different from false [2023-11-28 23:56:49,942 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse3 (* 18446744073709551616 (div (* .cse3 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse9 (* 18446744073709551616 (div (* (- 1) .cse9) 18446744073709551616))))))) is different from true [2023-11-28 23:56:50,198 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616))))) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) .cse3))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse4 (* 18446744073709551616 (div (* .cse4 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse6 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse7 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse7 (select |c_#memory_int#4| .cse7))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse10 (* 18446744073709551616 (div (* (- 1) .cse10) 18446744073709551616))))))) is different from false [2023-11-28 23:56:50,203 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616))))) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) .cse3))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse4 (* 18446744073709551616 (div (* .cse4 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse6 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse7 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse7 (select |c_#memory_int#4| .cse7))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse10 (* 18446744073709551616 (div (* (- 1) .cse10) 18446744073709551616))))))) is different from true [2023-11-28 23:56:50,389 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse4 (* 18446744073709551616 (div (* .cse4 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse6 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse7 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse7 (select |c_#memory_int#4| .cse7))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse10 (* 18446744073709551616 (div (* (- 1) .cse10) 18446744073709551616))))))) is different from false [2023-11-28 23:56:50,721 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse4 (* 18446744073709551616 (div (* .cse4 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse6 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse7 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse7 (select |c_#memory_int#4| .cse7))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse10 (* 18446744073709551616 (div (* (- 1) .cse10) 18446744073709551616))))))) is different from true [2023-11-28 23:56:51,491 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616))))) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) .cse4))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from false [2023-11-28 23:56:51,497 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616))))) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) .cse4))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from true [2023-11-28 23:56:51,711 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from false [2023-11-28 23:56:52,490 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from true [2023-11-28 23:56:52,662 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from false [2023-11-28 23:56:52,669 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from true [2023-11-28 23:56:52,847 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (let ((.cse10 (= (mod (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset) 18446744073709551616) 0))) (or (and |c_aws_byte_cursor_is_valid_#t~short700| .cse10) (and (not .cse10) (not |c_aws_byte_cursor_is_valid_#t~short700|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse11 (* (div (* (- 1) .cse11) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse12 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse12 (* 18446744073709551616 (div (* (- 1) .cse12) 18446744073709551616))))))) is different from false [2023-11-28 23:56:52,854 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (let ((.cse10 (= (mod (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset) 18446744073709551616) 0))) (or (and |c_aws_byte_cursor_is_valid_#t~short700| .cse10) (and (not .cse10) (not |c_aws_byte_cursor_is_valid_#t~short700|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse11 (* (div (* (- 1) .cse11) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse12 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse12 (* 18446744073709551616 (div (* (- 1) .cse12) 18446744073709551616))))))) is different from true [2023-11-28 23:56:52,997 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (not (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from false [2023-11-28 23:56:53,272 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_24|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_23|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25| Int)) (<= 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_25|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_22|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (not (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse5 (* 18446744073709551616 (div (* .cse5 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse7 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse8 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse8 (select |c_#memory_int#4| .cse8))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse9 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse9 (* (div (* (- 1) .cse9) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse10 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse10 (* (div (* (- 1) .cse10) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21| Int)) (<= 0 (let ((.cse11 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_21|) 0))) (+ .cse11 (* 18446744073709551616 (div (* (- 1) .cse11) 18446744073709551616))))))) is different from true [2023-11-28 23:56:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 140 not checked. [2023-11-28 23:56:53,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:54,067 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1290 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (or (not (= (mod (select v_ArrVal_1290 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset|) 18446744073709551616) 0)) (let ((.cse0 (select (select (store |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (< .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 1))))) is different from false [2023-11-28 23:56:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102631025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:54,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:56:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 39] total 50 [2023-11-28 23:56:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475652853] [2023-11-28 23:56:54,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:54,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-28 23:56:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-28 23:56:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=569, Unknown=57, NotChecked=2204, Total=2970 [2023-11-28 23:56:54,072 INFO L87 Difference]: Start difference. First operand 1529 states and 2000 transitions. Second operand has 50 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 39 states have internal predecessors, (129), 21 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (44), 19 states have call predecessors, (44), 21 states have call successors, (44) [2023-11-28 23:56:59,430 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse1 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616))) (and (<= 0 (+ .cse0 .cse1)) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (< 0 (+ .cse0 .cse1 1)) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (and (= (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2)) |c_#memory_int#4|) (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) .cse3))) (= .cse2 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|))))) (not (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|)) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616)))))))) is different from false [2023-11-28 23:56:59,434 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (let ((.cse0 (select .cse5 0))) (let ((.cse1 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616))) (and (<= 0 (+ .cse0 .cse1)) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (or (< 0 (+ .cse0 .cse1 1)) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (and (= (store |v_#memory_int#4_BEFORE_CALL_2| .cse2 (select |c_#memory_int#4| .cse2)) |c_#memory_int#4|) (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) .cse3))) (= .cse2 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|))))) (not (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|)) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616)))))))) is different from true [2023-11-28 23:56:59,457 WARN L854 $PredicateComparison]: unable to prove that (and (or |c_aws_byte_cursor_is_valid_#t~short700| (let ((.cse0 (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 18446744073709551616)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (let ((.cse4 (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0))) (or (and (not .cse4) (not |c_aws_byte_cursor_is_valid_#t~short700|)) (and |c_aws_byte_cursor_is_valid_#t~short700| .cse4)))) is different from false [2023-11-28 23:56:59,462 WARN L876 $PredicateComparison]: unable to prove that (and (or |c_aws_byte_cursor_is_valid_#t~short700| (let ((.cse0 (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 18446744073709551616)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (let ((.cse4 (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0))) (or (and (not .cse4) (not |c_aws_byte_cursor_is_valid_#t~short700|)) (and |c_aws_byte_cursor_is_valid_#t~short700| .cse4)))) is different from true [2023-11-28 23:56:59,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|))) (and (<= 0 (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= (mod .cse0 18446744073709551616) 0))) is different from false [2023-11-28 23:56:59,474 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|))) (and (<= 0 (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= (mod .cse0 18446744073709551616) 0))) is different from true [2023-11-28 23:56:59,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:59,489 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:56:59,503 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))))) is different from false [2023-11-28 23:56:59,509 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))))) is different from true [2023-11-28 23:56:59,529 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1225#1| (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|)) (<= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1225#1| (* 18446744073709551616 (div |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1225#1| 18446744073709551616))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))))) is different from false [2023-11-28 23:56:59,536 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1225#1| (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|)) (<= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1225#1| (* 18446744073709551616 (div |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1225#1| 18446744073709551616))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))))) is different from true [2023-11-28 23:56:59,550 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_#memory_int#6| |c_old(#memory_int#6)|)) is different from false [2023-11-28 23:56:59,556 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_#memory_int#6| |c_old(#memory_int#6)|)) is different from true [2023-11-28 23:56:59,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))))) is different from false [2023-11-28 23:56:59,588 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (= (mod (select (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))))) is different from true [2023-11-28 23:56:59,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse3 (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0))) (and (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1229#1| .cse3) (= (mod .cse3 18446744073709551616) 0)))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse6 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse7 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse7 (select |c_#memory_int#4| .cse7))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))))) is different from false [2023-11-28 23:56:59,617 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse3 (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0))) (and (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_#t~mem1229#1| .cse3) (= (mod .cse3 18446744073709551616) 0)))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616)))) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* 18446744073709551616 (div (* (- 1) .cse5) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse6 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse7 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse7 (select |c_#memory_int#4| .cse7))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))))) is different from true [2023-11-28 23:56:59,636 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (= |c_#memory_int#6| |c_old(#memory_int#6)|)) is different from false [2023-11-28 23:56:59,643 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse1 (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse2 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse3 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse3 (select |c_#memory_int#4| .cse3))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616))))) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (= |c_#memory_int#6| |c_old(#memory_int#6)|)) is different from true [2023-11-28 23:56:59,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)))) is different from false [2023-11-28 23:56:59,694 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse0 (select .cse1 0))) (+ .cse0 (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse4 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* 18446744073709551616 (div (* (- 1) .cse4) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse5 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse6 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse6 (select |c_#memory_int#4| .cse6))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse8 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse8 (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)))) is different from true [2023-11-28 23:56:59,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select .cse2 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset|))) (<= .cse8 (* 18446744073709551616 (div .cse8 18446744073709551616)))))) is different from false [2023-11-28 23:56:59,743 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#4| |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base|))) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (<= 0 (let ((.cse1 (select .cse2 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))) (= |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset| 0) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset|))) (<= .cse8 (* 18446744073709551616 (div .cse8 18446744073709551616)))))) is different from true [2023-11-28 23:56:59,788 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:59,796 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:56:59,835 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (or |c_aws_byte_cursor_is_valid_#t~short700| (let ((.cse0 (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 18446744073709551616)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (let ((.cse8 (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0))) (or (and (not .cse8) (not |c_aws_byte_cursor_is_valid_#t~short700|)) (and |c_aws_byte_cursor_is_valid_#t~short700| .cse8)))) is different from false [2023-11-28 23:56:59,842 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (or |c_aws_byte_cursor_is_valid_#t~short700| (let ((.cse0 (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 18446744073709551616)))) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse3 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse4 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse4 (* (div (* (- 1) .cse4) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse5 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse5 (select |c_#memory_int#4| .cse5))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse7 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse7 (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (let ((.cse8 (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0))) (or (and (not .cse8) (not |c_aws_byte_cursor_is_valid_#t~short700|)) (and |c_aws_byte_cursor_is_valid_#t~short700| .cse8)))) is different from true [2023-11-28 23:56:59,883 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (let ((.cse7 (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse7 (+ (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)) 18446744073709551615))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from false [2023-11-28 23:56:59,890 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (let ((.cse7 (select (select |c_#memory_int#4| c_aws_byte_cursor_is_valid_~cursor.base) c_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse7 (+ (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)) 18446744073709551615))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0))) is different from true [2023-11-28 23:57:00,092 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (let ((.cse7 (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|))) (<= .cse7 (+ 18446744073709551615 (* (div (+ (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) is different from false [2023-11-28 23:57:00,409 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (let ((.cse7 (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|))) (<= .cse7 (+ 18446744073709551615 (* (div (+ (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) is different from true [2023-11-28 23:57:00,480 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_#memory_int#5| |c_old(#memory_int#5)|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (= |c_old(#memory_$Pointer$#5.base)| |c_#memory_$Pointer$#5.base|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_#memory_real#5| |c_old(#memory_real#5)|) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (= |c_old(#memory_$Pointer$#5.offset)| |c_#memory_$Pointer$#5.offset|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (= |c_#memory_int#6| |c_old(#memory_int#6)|) (let ((.cse7 (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|))) (<= .cse7 (+ 18446744073709551615 (* (div (+ (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) is different from false [2023-11-28 23:57:00,486 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_55|) 0) 18446744073709551616) 0)) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74| Int)) (<= 0 (let ((.cse0 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_74|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_BEFORE_CALL_56|) 0) 18446744073709551616) 0)) (= |c_#memory_int#5| |c_old(#memory_int#5)|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20| Int)) (<= 0 (let ((.cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_20|) 0))) (+ .cse1 (* 18446744073709551616 (div (* .cse1 (- 1)) 18446744073709551616)))))) (= |c_old(#memory_$Pointer$#5.base)| |c_#memory_$Pointer$#5.base|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_#memory_real#5| |c_old(#memory_real#5)|) (exists ((|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (= (mod (select (select |c_#memory_int#4| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) 0) 18446744073709551616) 0)) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (< 0 (let ((.cse2 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) 1)))) (exists ((|v_#memory_int#4_BEFORE_CALL_2| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72| Int)) (and (<= 0 (let ((.cse3 (select (select |v_#memory_int#4_BEFORE_CALL_2| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_72|) 0))) (+ .cse3 (* (div (* (- 1) .cse3) 18446744073709551616) 18446744073709551616)))) (= (let ((.cse4 (@diff |v_#memory_int#4_BEFORE_CALL_2| |c_#memory_int#4|))) (store |v_#memory_int#4_BEFORE_CALL_2| .cse4 (select |c_#memory_int#4| .cse4))) |c_#memory_int#4|)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75| Int)) (<= 0 (let ((.cse5 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_75|) 0))) (+ .cse5 (* (div (* (- 1) .cse5) 18446744073709551616) 18446744073709551616))))) (= |c_old(#memory_$Pointer$#5.offset)| |c_#memory_$Pointer$#5.offset|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73| Int)) (<= 0 (let ((.cse6 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base_BEFORE_CALL_73|) 0))) (+ .cse6 (* (div (* (- 1) .cse6) 18446744073709551616) 18446744073709551616))))) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31| Int)) (= (mod (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base_31|) 0) 18446744073709551616) 0)) (= |c_#memory_int#6| |c_old(#memory_int#6)|) (let ((.cse7 (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|))) (<= .cse7 (+ 18446744073709551615 (* (div (+ (- 1) .cse7) 18446744073709551616) 18446744073709551616))))) is different from true