./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:47:09,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:47:09,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:47:09,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:47:09,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:47:09,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:47:09,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:47:09,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:47:09,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:47:09,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:47:09,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:47:09,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:47:09,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:47:09,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:47:09,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:47:09,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:47:09,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:47:09,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:47:09,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:47:09,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:47:09,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:47:09,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:47:09,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:47:09,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:47:09,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:47:09,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:47:09,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:47:09,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:47:09,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:47:09,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:47:09,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:47:09,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:47:09,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:47:09,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:47:09,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:47:09,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:47:09,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:47:09,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:47:09,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:47:09,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:47:09,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:47:09,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 17:47:09,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:47:09,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:47:09,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:47:09,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:47:09,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:47:09,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:47:09,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:47:09,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:47:09,977 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:47:09,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:47:09,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:47:09,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:47:09,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:47:09,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:47:09,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:47:09,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:47:09,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:47:09,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:47:09,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:47:09,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:47:09,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:47:09,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:47:09,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:47:09,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:47:09,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:47:09,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:47:09,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:47:09,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:47:09,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:47:09,988 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:47:09,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:47:09,989 INFO L138 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_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/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_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2022-11-25 17:47:10,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:47:10,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:47:10,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:47:10,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:47:10,345 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:47:10,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-25 17:47:13,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:47:14,067 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:47:14,072 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-25 17:47:14,125 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/data/83adf3565/7a134b25457c48d0b1687bd913933e66/FLAGf2dcb2c78 [2022-11-25 17:47:14,147 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/data/83adf3565/7a134b25457c48d0b1687bd913933e66 [2022-11-25 17:47:14,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:47:14,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:47:14,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:47:14,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:47:14,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:47:14,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:47:14" (1/1) ... [2022-11-25 17:47:14,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31473751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:14, skipping insertion in model container [2022-11-25 17:47:14,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:47:14" (1/1) ... [2022-11-25 17:47:14,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:47:14,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:47:14,581 WARN L237 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_37baba39-5866-40e2-82c4-44d4d88d2362/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-25 17:47:14,589 WARN L237 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_37baba39-5866-40e2-82c4-44d4d88d2362/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-25 17:47:15,795 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,796 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,797 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,798 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,800 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,816 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,817 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,819 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,820 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:15,930 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:47:15,931 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:47:15,932 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:47:15,938 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:47:15,940 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:47:15,941 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:47:16,380 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:47:16,382 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:47:16,384 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:47:16,385 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:47:16,387 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:47:16,388 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:47:16,389 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:47:16,390 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:47:16,392 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:47:16,393 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:47:16,394 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:47:16,681 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:47:16,721 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:47:16,743 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:47:16,796 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:47:16,815 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:16,826 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:16,930 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:47:16,982 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:47:16,984 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:47:17,003 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:47:17,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:47:17,071 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:47:17,085 WARN L237 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_37baba39-5866-40e2-82c4-44d4d88d2362/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-25 17:47:17,086 WARN L237 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_37baba39-5866-40e2-82c4-44d4d88d2362/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-25 17:47:17,118 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,118 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,119 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,119 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,120 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,126 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,126 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,127 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,128 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,134 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:47:17,135 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:47:17,135 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:47:17,138 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:47:17,139 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:47:17,140 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:47:17,159 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:47:17,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:47:17,161 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:47:17,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:47:17,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:47:17,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:47:17,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:47:17,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:47:17,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:47:17,166 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:47:17,166 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:47:17,185 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:47:17,206 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:47:17,211 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:47:17,228 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:47:17,235 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,235 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:47:17,258 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:47:17,263 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:47:17,264 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:47:17,268 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:47:17,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:47:17,582 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:47:17,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17 WrapperNode [2022-11-25 17:47:17,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:47:17,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:47:17,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:47:17,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:47:17,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,752 INFO L138 Inliner]: procedures = 693, calls = 2791, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 873 [2022-11-25 17:47:17,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:47:17,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:47:17,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:47:17,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:47:17,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,807 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:47:17,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:47:17,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:47:17,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:47:17,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (1/1) ... [2022-11-25 17:47:17,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:47:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:17,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:47:17,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:47:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-25 17:47:17,924 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-25 17:47:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-25 17:47:17,924 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-25 17:47:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-11-25 17:47:17,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-11-25 17:47:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 17:47:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:47:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 17:47:17,925 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 17:47:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:47:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 17:47:17,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 17:47:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:47:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:47:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:47:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:47:17,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:47:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 17:47:17,927 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 17:47:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-25 17:47:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:47:17,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:47:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:47:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:47:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-11-25 17:47:17,928 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-11-25 17:47:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:47:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-25 17:47:17,928 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-25 17:47:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 17:47:17,928 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 17:47:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:47:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:47:18,329 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:47:18,333 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:47:20,015 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:47:20,025 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:47:20,026 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:47:20,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:47:20 BoogieIcfgContainer [2022-11-25 17:47:20,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:47:20,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:47:20,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:47:20,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:47:20,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:47:14" (1/3) ... [2022-11-25 17:47:20,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ba70d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:47:20, skipping insertion in model container [2022-11-25 17:47:20,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:47:17" (2/3) ... [2022-11-25 17:47:20,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ba70d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:47:20, skipping insertion in model container [2022-11-25 17:47:20,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:47:20" (3/3) ... [2022-11-25 17:47:20,053 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2022-11-25 17:47:20,079 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:47:20,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:47:20,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:47:20,149 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33799340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:47:20,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:47:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 17:47:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 17:47:20,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:20,173 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:20,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 39505431, now seen corresponding path program 1 times [2022-11-25 17:47:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:20,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765384813] [2022-11-25 17:47:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:47:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:47:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 17:47:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-25 17:47:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:21,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765384813] [2022-11-25 17:47:21,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765384813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:21,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:47:21,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:47:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337803817] [2022-11-25 17:47:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:47:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:47:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:47:21,066 INFO L87 Difference]: Start difference. First operand has 130 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 17:47:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:21,407 INFO L93 Difference]: Finished difference Result 251 states and 348 transitions. [2022-11-25 17:47:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:47:21,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-11-25 17:47:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:21,418 INFO L225 Difference]: With dead ends: 251 [2022-11-25 17:47:21,418 INFO L226 Difference]: Without dead ends: 125 [2022-11-25 17:47:21,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:47:21,425 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:21,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 162 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:47:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-25 17:47:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-25 17:47:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 84 states have internal predecessors, (104), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 17:47:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2022-11-25 17:47:21,474 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 71 [2022-11-25 17:47:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:21,475 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2022-11-25 17:47:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 17:47:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2022-11-25 17:47:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 17:47:21,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:21,479 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:21,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:47:21,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 899154193, now seen corresponding path program 1 times [2022-11-25 17:47:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:21,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087142380] [2022-11-25 17:47:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:47:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:47:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 17:47:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-25 17:47:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087142380] [2022-11-25 17:47:22,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087142380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:22,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:47:22,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:47:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73765417] [2022-11-25 17:47:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:22,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:47:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:22,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:47:22,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:47:22,524 INFO L87 Difference]: Start difference. First operand 125 states and 165 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 17:47:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:23,060 INFO L93 Difference]: Finished difference Result 211 states and 280 transitions. [2022-11-25 17:47:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:47:23,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 71 [2022-11-25 17:47:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:23,064 INFO L225 Difference]: With dead ends: 211 [2022-11-25 17:47:23,064 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 17:47:23,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:47:23,066 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 105 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:23,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 344 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:47:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 17:47:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-25 17:47:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 87 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-25 17:47:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2022-11-25 17:47:23,082 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 71 [2022-11-25 17:47:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:23,083 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2022-11-25 17:47:23,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 17:47:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2022-11-25 17:47:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 17:47:23,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:23,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:23,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:47:23,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1350542876, now seen corresponding path program 1 times [2022-11-25 17:47:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:23,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268454900] [2022-11-25 17:47:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:47:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:47:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-25 17:47:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:23,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268454900] [2022-11-25 17:47:23,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268454900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:23,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:47:23,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:47:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022937981] [2022-11-25 17:47:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:23,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:47:23,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:23,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:47:23,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:47:23,841 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 17:47:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:24,363 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-11-25 17:47:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:47:24,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 77 [2022-11-25 17:47:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:24,366 INFO L225 Difference]: With dead ends: 219 [2022-11-25 17:47:24,366 INFO L226 Difference]: Without dead ends: 163 [2022-11-25 17:47:24,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:47:24,368 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:24,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:47:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-25 17:47:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-11-25 17:47:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 108 states have internal predecessors, (132), 43 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-11-25 17:47:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 219 transitions. [2022-11-25 17:47:24,388 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 219 transitions. Word has length 77 [2022-11-25 17:47:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:24,389 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 219 transitions. [2022-11-25 17:47:24,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 17:47:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 219 transitions. [2022-11-25 17:47:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 17:47:24,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:24,393 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-25 17:47:24,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:47:24,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash 32555997, now seen corresponding path program 1 times [2022-11-25 17:47:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:24,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394710056] [2022-11-25 17:47:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:24,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:47:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:47:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:47:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:47:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:25,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394710056] [2022-11-25 17:47:25,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394710056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:25,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:47:25,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:47:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801204001] [2022-11-25 17:47:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:25,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:47:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:25,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:47:25,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:47:25,566 INFO L87 Difference]: Start difference. First operand 161 states and 219 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:47:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:26,175 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2022-11-25 17:47:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:47:26,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2022-11-25 17:47:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:26,178 INFO L225 Difference]: With dead ends: 172 [2022-11-25 17:47:26,178 INFO L226 Difference]: Without dead ends: 165 [2022-11-25 17:47:26,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:47:26,180 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:26,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 648 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:47:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-25 17:47:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-25 17:47:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 109 states have (on average 1.238532110091743) internal successors, (135), 112 states have internal predecessors, (135), 43 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (48), 42 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-25 17:47:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 226 transitions. [2022-11-25 17:47:26,197 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 226 transitions. Word has length 89 [2022-11-25 17:47:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:26,197 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 226 transitions. [2022-11-25 17:47:26,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:47:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 226 transitions. [2022-11-25 17:47:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 17:47:26,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:26,201 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-25 17:47:26,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:47:26,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 581239205, now seen corresponding path program 1 times [2022-11-25 17:47:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:26,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790476554] [2022-11-25 17:47:26,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:47:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:47:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:47:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-25 17:47:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790476554] [2022-11-25 17:47:27,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790476554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:27,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:47:27,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:47:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123797656] [2022-11-25 17:47:27,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:47:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:47:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:47:27,342 INFO L87 Difference]: Start difference. First operand 165 states and 226 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:47:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:27,867 INFO L93 Difference]: Finished difference Result 300 states and 420 transitions. [2022-11-25 17:47:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:47:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2022-11-25 17:47:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:27,870 INFO L225 Difference]: With dead ends: 300 [2022-11-25 17:47:27,870 INFO L226 Difference]: Without dead ends: 190 [2022-11-25 17:47:27,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:47:27,872 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:27,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 314 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:47:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-25 17:47:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2022-11-25 17:47:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 117 states have internal predecessors, (142), 43 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (48), 42 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-25 17:47:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2022-11-25 17:47:27,889 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 93 [2022-11-25 17:47:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:27,890 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2022-11-25 17:47:27,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:47:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2022-11-25 17:47:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 17:47:27,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:27,892 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-25 17:47:27,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:47:27,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash 839404643, now seen corresponding path program 1 times [2022-11-25 17:47:27,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:27,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601714647] [2022-11-25 17:47:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:47:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:47:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:47:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:47:30,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601714647] [2022-11-25 17:47:30,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601714647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:47:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80814797] [2022-11-25 17:47:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:30,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:30,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:47:30,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:47:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:30,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 2597 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 17:47:30,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:47:30,931 INFO L350 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 13 treesize of output 9 [2022-11-25 17:47:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:47:31,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:47:31,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80814797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:31,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:47:31,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2022-11-25 17:47:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383939315] [2022-11-25 17:47:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:31,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:47:31,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:31,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:47:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:47:31,313 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 17:47:34,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:47:37,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:47:39,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:47:41,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:47:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:41,509 INFO L93 Difference]: Finished difference Result 300 states and 402 transitions. [2022-11-25 17:47:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:47:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-11-25 17:47:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:41,511 INFO L225 Difference]: With dead ends: 300 [2022-11-25 17:47:41,511 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 17:47:41,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:47:41,513 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 223 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 56 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:41,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 824 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 405 Invalid, 4 Unknown, 0 Unchecked, 10.0s Time] [2022-11-25 17:47:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 17:47:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-11-25 17:47:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 124 states have internal predecessors, (150), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (45), 43 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-25 17:47:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2022-11-25 17:47:41,545 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 93 [2022-11-25 17:47:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:41,546 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2022-11-25 17:47:41,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 17:47:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2022-11-25 17:47:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 17:47:41,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:41,550 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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] [2022-11-25 17:47:41,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:47:41,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 17:47:41,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash 302071913, now seen corresponding path program 1 times [2022-11-25 17:47:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713072989] [2022-11-25 17:47:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:47:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 17:47:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 17:47:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 17:47:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:47:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 17:47:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:43,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713072989] [2022-11-25 17:47:43,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713072989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:47:43,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709707533] [2022-11-25 17:47:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:43,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:43,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:47:43,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:47:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:43,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:47:43,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:47:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 17:47:43,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:47:43,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709707533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:43,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:47:43,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-11-25 17:47:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618899926] [2022-11-25 17:47:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:47:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:47:43,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:47:43,723 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 17:47:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:43,899 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2022-11-25 17:47:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:47:43,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2022-11-25 17:47:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:43,905 INFO L225 Difference]: With dead ends: 302 [2022-11-25 17:47:43,906 INFO L226 Difference]: Without dead ends: 190 [2022-11-25 17:47:43,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:47:43,907 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 13 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:43,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1172 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:47:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-25 17:47:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-11-25 17:47:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 129 states have internal predecessors, (154), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-25 17:47:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-11-25 17:47:43,941 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 97 [2022-11-25 17:47:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:43,942 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-11-25 17:47:43,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 17:47:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-11-25 17:47:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:47:43,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:43,944 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:47:43,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:47:44,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:44,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1510879250, now seen corresponding path program 1 times [2022-11-25 17:47:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:44,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085092518] [2022-11-25 17:47:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:47:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:47:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:47:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 17:47:44,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085092518] [2022-11-25 17:47:44,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085092518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:47:44,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476082509] [2022-11-25 17:47:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:44,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:44,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:44,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:47:44,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:47:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 2609 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:47:45,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:47:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:47:45,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:47:45,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476082509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:45,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:47:45,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:47:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050990916] [2022-11-25 17:47:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:45,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:47:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:47:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:47:45,146 INFO L87 Difference]: Start difference. First operand 187 states and 246 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 17:47:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:45,187 INFO L93 Difference]: Finished difference Result 309 states and 417 transitions. [2022-11-25 17:47:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:47:45,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-25 17:47:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:45,191 INFO L225 Difference]: With dead ends: 309 [2022-11-25 17:47:45,191 INFO L226 Difference]: Without dead ends: 192 [2022-11-25 17:47:45,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:47:45,193 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:45,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 483 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:47:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-25 17:47:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-11-25 17:47:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 128 states have (on average 1.21875) internal successors, (156), 131 states have internal predecessors, (156), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-25 17:47:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2022-11-25 17:47:45,217 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 99 [2022-11-25 17:47:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:45,217 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2022-11-25 17:47:45,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 17:47:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2022-11-25 17:47:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:47:45,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:45,224 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-25 17:47:45,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:47:45,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:45,433 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1932962354, now seen corresponding path program 1 times [2022-11-25 17:47:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:45,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347187323] [2022-11-25 17:47:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:47:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:47:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:47:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-25 17:47:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:45,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347187323] [2022-11-25 17:47:45,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347187323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:47:45,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713015802] [2022-11-25 17:47:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:45,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:45,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:47:45,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:47:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:46,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:47:46,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:47:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 17:47:46,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:47:46,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713015802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:46,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:47:46,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:47:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510479632] [2022-11-25 17:47:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:46,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:47:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:46,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:47:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:47:46,434 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 17:47:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:47:46,472 INFO L93 Difference]: Finished difference Result 325 states and 438 transitions. [2022-11-25 17:47:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:47:46,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-25 17:47:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:47:46,475 INFO L225 Difference]: With dead ends: 325 [2022-11-25 17:47:46,475 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 17:47:46,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:47:46,478 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:47:46,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 498 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:47:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 17:47:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2022-11-25 17:47:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 128 states have (on average 1.2109375) internal successors, (155), 131 states have internal predecessors, (155), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-25 17:47:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2022-11-25 17:47:46,493 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 99 [2022-11-25 17:47:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:47:46,494 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2022-11-25 17:47:46,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 17:47:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2022-11-25 17:47:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:47:46,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:47:46,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-25 17:47:46,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 17:47:46,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:46,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:47:46,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash -400430284, now seen corresponding path program 1 times [2022-11-25 17:47:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:46,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957964656] [2022-11-25 17:47:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:47:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:47:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:47:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:47:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:47:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:47:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:47:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:49,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:47:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:47:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:47:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:47:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:47:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:49,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957964656] [2022-11-25 17:47:49,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957964656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:47:49,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086366107] [2022-11-25 17:47:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:47:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:47:49,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:47:49,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:47:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:50,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 17:47:50,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:47:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:47:51,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:47:51,619 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 17:47:51,619 INFO L350 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 24 treesize of output 19 [2022-11-25 17:47:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:47:51,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086366107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:47:51,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:47:51,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 25 [2022-11-25 17:47:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342663640] [2022-11-25 17:47:51,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:47:51,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 17:47:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 17:47:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:47:51,649 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 17:47:54,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:47:56,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:47:58,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:01,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:03,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:05,336 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2022-11-25 17:48:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 17:48:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 99 [2022-11-25 17:48:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:05,347 INFO L225 Difference]: With dead ends: 277 [2022-11-25 17:48:05,347 INFO L226 Difference]: Without dead ends: 223 [2022-11-25 17:48:05,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 17:48:05,349 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 373 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 105 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:05,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 856 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2034 Invalid, 5 Unknown, 0 Unchecked, 12.9s Time] [2022-11-25 17:48:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-25 17:48:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2022-11-25 17:48:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.1917808219178083) internal successors, (174), 147 states have internal predecessors, (174), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (45), 43 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-25 17:48:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2022-11-25 17:48:05,396 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 99 [2022-11-25 17:48:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:05,396 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2022-11-25 17:48:05,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 17:48:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2022-11-25 17:48:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:48:05,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:05,399 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:48:05,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:48:05,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:48:05,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 768159994, now seen corresponding path program 1 times [2022-11-25 17:48:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544726206] [2022-11-25 17:48:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:48:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:48:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:48:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:48:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:48:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:48:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:48:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:48:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:48:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:48:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 17:48:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:08,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544726206] [2022-11-25 17:48:08,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544726206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:48:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6257132] [2022-11-25 17:48:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:08,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:48:08,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:48:08,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:48:08,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:48:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:08,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 2603 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-25 17:48:08,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:48:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:48:09,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:48:10,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:48:10,801 INFO L350 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 1 [2022-11-25 17:48:10,989 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-25 17:48:10,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2022-11-25 17:48:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:48:11,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6257132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:48:11,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:48:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 30 [2022-11-25 17:48:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093182080] [2022-11-25 17:48:11,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:48:11,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 17:48:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:11,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 17:48:11,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-11-25 17:48:11,170 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-25 17:48:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:18,774 INFO L93 Difference]: Finished difference Result 398 states and 508 transitions. [2022-11-25 17:48:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 17:48:18,775 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 99 [2022-11-25 17:48:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:18,777 INFO L225 Difference]: With dead ends: 398 [2022-11-25 17:48:18,777 INFO L226 Difference]: Without dead ends: 379 [2022-11-25 17:48:18,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=943, Invalid=3479, Unknown=0, NotChecked=0, Total=4422 [2022-11-25 17:48:18,780 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 413 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:18,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1035 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 17:48:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-25 17:48:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-11-25 17:48:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 248 states have (on average 1.2056451612903225) internal successors, (299), 250 states have internal predecessors, (299), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-25 17:48:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 444 transitions. [2022-11-25 17:48:18,826 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 444 transitions. Word has length 99 [2022-11-25 17:48:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:18,826 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 444 transitions. [2022-11-25 17:48:18,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-25 17:48:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 444 transitions. [2022-11-25 17:48:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:48:18,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:18,829 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:48:18,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:48:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 17:48:19,044 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2140021892, now seen corresponding path program 1 times [2022-11-25 17:48:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905975397] [2022-11-25 17:48:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:48:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:21,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:48:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:48:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:48:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:48:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:48:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:48:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:48:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:22,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:48:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:48:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 17:48:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:22,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905975397] [2022-11-25 17:48:22,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905975397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:48:22,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965832970] [2022-11-25 17:48:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:48:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:48:22,430 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:48:22,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:48:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:23,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:48:23,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:48:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:48:24,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:48:25,385 INFO L321 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-11-25 17:48:25,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 49 [2022-11-25 17:48:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:48:25,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965832970] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:48:25,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:48:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 30 [2022-11-25 17:48:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205638180] [2022-11-25 17:48:25,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:48:25,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 17:48:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 17:48:25,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-11-25 17:48:25,751 INFO L87 Difference]: Start difference. First operand 344 states and 444 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 17:48:28,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:30,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:32,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:37,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:39,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:42,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:42,790 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2022-11-25 17:48:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 17:48:42,791 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 99 [2022-11-25 17:48:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:42,793 INFO L225 Difference]: With dead ends: 396 [2022-11-25 17:48:42,793 INFO L226 Difference]: Without dead ends: 380 [2022-11-25 17:48:42,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 193 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=475, Invalid=1877, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 17:48:42,795 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 316 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 97 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:42,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 802 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2162 Invalid, 6 Unknown, 0 Unchecked, 15.5s Time] [2022-11-25 17:48:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-25 17:48:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 351. [2022-11-25 17:48:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 255 states have (on average 1.203921568627451) internal successors, (307), 257 states have internal predecessors, (307), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-25 17:48:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 452 transitions. [2022-11-25 17:48:42,851 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 452 transitions. Word has length 99 [2022-11-25 17:48:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:42,851 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 452 transitions. [2022-11-25 17:48:42,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 17:48:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 452 transitions. [2022-11-25 17:48:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:48:42,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:42,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-25 17:48:42,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:48:43,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:48:43,065 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1881856454, now seen corresponding path program 1 times [2022-11-25 17:48:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:43,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125906198] [2022-11-25 17:48:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:48:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:48:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:48:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:48:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:48:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:48:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:48:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:48:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:48:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:48:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-25 17:48:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:43,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125906198] [2022-11-25 17:48:43,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125906198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:43,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:43,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:48:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97370979] [2022-11-25 17:48:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:43,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:48:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:48:43,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:48:43,866 INFO L87 Difference]: Start difference. First operand 351 states and 452 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:48:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:44,438 INFO L93 Difference]: Finished difference Result 535 states and 680 transitions. [2022-11-25 17:48:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:48:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2022-11-25 17:48:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:44,442 INFO L225 Difference]: With dead ends: 535 [2022-11-25 17:48:44,442 INFO L226 Difference]: Without dead ends: 359 [2022-11-25 17:48:44,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:48:44,445 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 79 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:44,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 389 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:48:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-25 17:48:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 349. [2022-11-25 17:48:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 255 states have internal predecessors, (302), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-25 17:48:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2022-11-25 17:48:44,502 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 99 [2022-11-25 17:48:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:44,504 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2022-11-25 17:48:44,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:48:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2022-11-25 17:48:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 17:48:44,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:44,507 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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] [2022-11-25 17:48:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:48:44,507 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash 964318207, now seen corresponding path program 1 times [2022-11-25 17:48:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:44,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116576688] [2022-11-25 17:48:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:48:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:48:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:48:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:48:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:48:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:48:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:48:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:48:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:48:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:48:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 17:48:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:45,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116576688] [2022-11-25 17:48:45,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116576688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:45,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:45,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 17:48:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949991975] [2022-11-25 17:48:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:45,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:48:45,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:45,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:48:45,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:48:45,515 INFO L87 Difference]: Start difference. First operand 349 states and 447 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:48:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:46,270 INFO L93 Difference]: Finished difference Result 363 states and 462 transitions. [2022-11-25 17:48:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:48:46,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2022-11-25 17:48:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:46,273 INFO L225 Difference]: With dead ends: 363 [2022-11-25 17:48:46,273 INFO L226 Difference]: Without dead ends: 323 [2022-11-25 17:48:46,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:48:46,274 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:46,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 814 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:48:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-25 17:48:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 304. [2022-11-25 17:48:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.2009132420091324) internal successors, (263), 221 states have internal predecessors, (263), 60 states have call successors, (60), 23 states have call predecessors, (60), 24 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-11-25 17:48:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 384 transitions. [2022-11-25 17:48:46,323 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 384 transitions. Word has length 101 [2022-11-25 17:48:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:46,323 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 384 transitions. [2022-11-25 17:48:46,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:48:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 384 transitions. [2022-11-25 17:48:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 17:48:46,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:46,326 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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] [2022-11-25 17:48:46,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:48:46,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1368667261, now seen corresponding path program 1 times [2022-11-25 17:48:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:46,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154459038] [2022-11-25 17:48:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:48:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:48:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:48:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:48:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:48:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:48:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:48:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:48:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 17:48:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:48:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 17:48:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:48,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154459038] [2022-11-25 17:48:48,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154459038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:48,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:48,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-25 17:48:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023105338] [2022-11-25 17:48:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:48,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:48:48,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:48:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:48:48,648 INFO L87 Difference]: Start difference. First operand 304 states and 384 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 17:48:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:50,040 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-11-25 17:48:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:48:50,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2022-11-25 17:48:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:50,042 INFO L225 Difference]: With dead ends: 324 [2022-11-25 17:48:50,043 INFO L226 Difference]: Without dead ends: 272 [2022-11-25 17:48:50,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:48:50,044 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 181 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:50,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 858 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 17:48:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-25 17:48:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2022-11-25 17:48:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.2032967032967032) internal successors, (219), 184 states have internal predecessors, (219), 46 states have call successors, (46), 22 states have call predecessors, (46), 23 states have return successors, (45), 45 states have call predecessors, (45), 44 states have call successors, (45) [2022-11-25 17:48:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2022-11-25 17:48:50,092 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 101 [2022-11-25 17:48:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:50,092 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2022-11-25 17:48:50,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 17:48:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2022-11-25 17:48:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 17:48:50,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:48:50,095 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:50,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:48:50,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:48:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -171267616, now seen corresponding path program 1 times [2022-11-25 17:48:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:50,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238253920] [2022-11-25 17:48:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:48:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:48:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:48:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:48:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:48:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:48:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:48:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 17:48:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:48:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 17:48:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 17:48:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 17:48:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 17:48:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:48:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-25 17:48:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238253920] [2022-11-25 17:48:51,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238253920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:48:51,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854288621] [2022-11-25 17:48:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:48:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:48:51,467 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:48:51,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:48:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:52,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 2715 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 17:48:52,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:48:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-25 17:48:52,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:48:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-25 17:48:52,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854288621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:48:52,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:48:52,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2022-11-25 17:48:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499749462] [2022-11-25 17:48:52,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:48:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:48:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:48:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:48:52,416 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-25 17:48:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:53,156 INFO L93 Difference]: Finished difference Result 262 states and 317 transitions. [2022-11-25 17:48:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:48:53,157 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) Word has length 117 [2022-11-25 17:48:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:48:53,157 INFO L225 Difference]: With dead ends: 262 [2022-11-25 17:48:53,157 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:48:53,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 17:48:53,159 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 54 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:48:53,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 250 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:48:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:48:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:48:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:48:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:48:53,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2022-11-25 17:48:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:48:53,160 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:48:53,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-25 17:48:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:48:53,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:48:53,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:48:53,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:48:53,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:48:53,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:48:59,862 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1))))) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-11-25 17:48:59,862 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-11-25 17:48:59,863 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-25 17:48:59,863 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-11-25 17:48:59,864 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse1 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (let ((.cse0 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (and (<= (+ .cse0 1) |ensure_string_is_allocated_bounded_length_~len~1#1|) (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ .cse0 15)))) .cse1) (or .cse1 (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-25 17:48:59,864 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-11-25 17:48:59,865 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-25 17:48:59,865 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-11-25 17:48:59,865 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-25 17:48:59,866 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-25 17:48:59,866 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-11-25 17:48:59,866 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-11-25 17:48:59,867 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-25 17:48:59,867 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-11-25 17:48:59,867 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-11-25 17:48:59,867 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-25 17:48:59,867 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-25 17:48:59,867 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-25 17:48:59,868 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-25 17:48:59,868 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (or (= |bounded_malloc_#in~size| bounded_malloc_~size) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))))) (= |old(#valid)| |#valid|)) [2022-11-25 17:48:59,868 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-11-25 17:48:59,869 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-11-25 17:48:59,869 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-11-25 17:48:59,869 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-11-25 17:48:59,869 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-11-25 17:48:59,869 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-11-25 17:48:59,869 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-11-25 17:48:59,869 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,870 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,870 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,870 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,870 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-11-25 17:48:59,870 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-11-25 17:48:59,870 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-11-25 17:48:59,871 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-11-25 17:48:59,871 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-11-25 17:48:59,871 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,871 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,871 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-11-25 17:48:59,871 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-25 17:48:59,872 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-25 17:48:59,873 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-25 17:48:59,873 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-25 17:48:59,873 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-25 17:48:59,873 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-25 17:48:59,873 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-11-25 17:48:59,873 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-11-25 17:48:59,874 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-11-25 17:48:59,874 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-11-25 17:48:59,874 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-11-25 17:48:59,874 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-11-25 17:48:59,874 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-11-25 17:48:59,874 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-11-25 17:48:59,875 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-11-25 17:48:59,875 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-11-25 17:48:59,875 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-25 17:48:59,875 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-25 17:48:59,875 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-25 17:48:59,876 INFO L895 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,876 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-25 17:48:59,876 INFO L899 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2022-11-25 17:48:59,876 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-11-25 17:48:59,876 INFO L895 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,877 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-11-25 17:48:59,877 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-25 17:48:59,877 INFO L899 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2022-11-25 17:48:59,877 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-11-25 17:48:59,877 INFO L895 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,878 INFO L895 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2022-11-25 17:48:59,878 INFO L895 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2022-11-25 17:48:59,878 INFO L899 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2022-11-25 17:48:59,878 INFO L899 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2022-11-25 17:48:59,879 INFO L895 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,879 INFO L899 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2022-11-25 17:48:59,879 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:48:59,879 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:48:59,879 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:48:59,880 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-25 17:48:59,880 INFO L902 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2022-11-25 17:48:59,880 INFO L899 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2022-11-25 17:48:59,880 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-11-25 17:48:59,880 INFO L895 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,881 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-11-25 17:48:59,881 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-25 17:48:59,881 INFO L899 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2022-11-25 17:48:59,881 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-11-25 17:48:59,881 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2022-11-25 17:48:59,882 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0))) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|))) (or (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1341#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1341#1|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|) .cse0 .cse1 .cse2) (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse5 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)))) (let ((.cse4 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse4 (+ .cse3 (* 18446744073709551616 (div (+ (- .cse3) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616))))) .cse0 .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) .cse2 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-25 17:48:59,882 INFO L895 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,882 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-11-25 17:48:59,882 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-11-25 17:48:59,883 INFO L899 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2022-11-25 17:48:59,883 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-25 17:48:59,883 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:48:59,883 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-25 17:48:59,883 INFO L895 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2022-11-25 17:48:59,883 INFO L899 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2022-11-25 17:48:59,884 INFO L899 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2022-11-25 17:48:59,884 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) [2022-11-25 17:48:59,884 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-11-25 17:48:59,884 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-25 17:48:59,884 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-11-25 17:48:59,885 INFO L895 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) [2022-11-25 17:48:59,885 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-11-25 17:48:59,885 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-25 17:48:59,885 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-11-25 17:48:59,885 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1349#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1349#1| 1)) [2022-11-25 17:48:59,886 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-11-25 17:48:59,886 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-11-25 17:48:59,886 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-25 17:48:59,886 INFO L899 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2022-11-25 17:48:59,887 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,887 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-11-25 17:48:59,887 INFO L899 garLoopResultBuilder]: For program point L9548-2(lines 9548 9554) no Hoare annotation was computed. [2022-11-25 17:48:59,887 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-25 17:48:59,888 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-25 17:48:59,888 INFO L895 garLoopResultBuilder]: At program point L9548-4(lines 9548 9554) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-25 17:48:59,888 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-11-25 17:48:59,888 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-25 17:48:59,889 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-25 17:48:59,889 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-25 17:48:59,889 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-25 17:48:59,889 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-25 17:48:59,889 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-25 17:48:59,893 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:59,895 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:48:59,903 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,904 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,905 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:48:59,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,920 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:48:59,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,921 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:48:59,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:48:59,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:48:59,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,934 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,935 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:48:59,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:48:59,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:48:59,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:48:59,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:48:59 BoogieIcfgContainer [2022-11-25 17:48:59,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:48:59,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:48:59,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:48:59,947 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:48:59,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:47:20" (3/4) ... [2022-11-25 17:48:59,951 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:48:59,957 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-11-25 17:48:59,958 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-25 17:48:59,958 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-11-25 17:48:59,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-25 17:48:59,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-25 17:48:59,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-25 17:48:59,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 17:48:59,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 17:48:59,960 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-25 17:48:59,960 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-11-25 17:48:59,978 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-11-25 17:48:59,982 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-11-25 17:48:59,983 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-25 17:48:59,985 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-25 17:48:59,986 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-25 17:48:59,987 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 17:48:59,988 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:48:59,990 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:49:00,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: !(\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: !(0 <= 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0]))) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) [2022-11-25 17:49:00,034 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((str == 0 && str == 0) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0])) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0))) && !(buf == 0)) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616))) && buf == 0 [2022-11-25 17:49:00,489 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:49:00,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:49:00,490 INFO L158 Benchmark]: Toolchain (without parser) took 106336.36ms. Allocated memory was 195.0MB in the beginning and 488.6MB in the end (delta: 293.6MB). Free memory was 148.4MB in the beginning and 368.8MB in the end (delta: -220.4MB). Peak memory consumption was 329.3MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,490 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 121.6MB. Free memory was 90.8MB in the beginning and 90.7MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:49:00,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3426.68ms. Allocated memory is still 195.0MB. Free memory was 147.9MB in the beginning and 111.7MB in the end (delta: 36.3MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 168.58ms. Allocated memory is still 195.0MB. Free memory was 111.7MB in the beginning and 99.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,491 INFO L158 Benchmark]: Boogie Preprocessor took 65.60ms. Allocated memory is still 195.0MB. Free memory was 99.2MB in the beginning and 91.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,492 INFO L158 Benchmark]: RCFGBuilder took 2209.57ms. Allocated memory was 195.0MB in the beginning and 281.0MB in the end (delta: 86.0MB). Free memory was 91.8MB in the beginning and 187.3MB in the end (delta: -95.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,492 INFO L158 Benchmark]: TraceAbstraction took 99912.81ms. Allocated memory was 281.0MB in the beginning and 488.6MB in the end (delta: 207.6MB). Free memory was 186.2MB in the beginning and 208.0MB in the end (delta: -21.8MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,492 INFO L158 Benchmark]: Witness Printer took 542.78ms. Allocated memory is still 488.6MB. Free memory was 208.0MB in the beginning and 368.8MB in the end (delta: -160.8MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2022-11-25 17:49:00,494 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 121.6MB. Free memory was 90.8MB in the beginning and 90.7MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3426.68ms. Allocated memory is still 195.0MB. Free memory was 147.9MB in the beginning and 111.7MB in the end (delta: 36.3MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 168.58ms. Allocated memory is still 195.0MB. Free memory was 111.7MB in the beginning and 99.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.60ms. Allocated memory is still 195.0MB. Free memory was 99.2MB in the beginning and 91.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2209.57ms. Allocated memory was 195.0MB in the beginning and 281.0MB in the end (delta: 86.0MB). Free memory was 91.8MB in the beginning and 187.3MB in the end (delta: -95.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 99912.81ms. Allocated memory was 281.0MB in the beginning and 488.6MB in the end (delta: 207.6MB). Free memory was 186.2MB in the beginning and 208.0MB in the end (delta: -21.8MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. * Witness Printer took 542.78ms. Allocated memory is still 488.6MB. Free memory was 208.0MB in the beginning and 368.8MB in the end (delta: -160.8MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 99.8s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 54.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 2368 SdHoareTripleChecker+Valid, 47.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2235 mSDsluCounter, 9768 SdHoareTripleChecker+Invalid, 45.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7967 mSDsCounter, 699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11635 IncrementalHoareTripleChecker+Invalid, 12349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 699 mSolverCounterUnsat, 1801 mSDtfsCounter, 11635 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1839 GetRequests, 1503 SyntacticMatches, 31 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=12, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 177 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 359 PreInvPairs, 395 NumberOfFragments, 1931 HoareAnnotationTreeSize, 359 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 5783 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 2306 NumberOfCodeBlocks, 2306 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2692 ConstructedInterpolants, 101 QuantifiedInterpolants, 15263 SizeOfPredicates, 74 NumberOfNonLiveVariables, 20953 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 1690/1864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant [2022-11-25 17:49:00,507 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,508 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:49:00,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:49:00,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] Derived loop invariant: (((((str == 0 && str == 0) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0])) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0))) && !(buf == 0)) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616))) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2022-11-25 17:49:00,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:49:00,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-unknown-#memory_int-unknown[buf][16] + 18446744073709551615) / 18446744073709551616) + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][buf + 8] == 0)) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 6806]: Loop Invariant [2022-11-25 17:49:00,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:49:00,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:49:00,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-25 17:49:00,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-25 17:49:00,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-25 17:49:00,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] Derived loop invariant: (((forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: !(\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: !(0 <= 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0]))) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) RESULT: Ultimate proved your program to be correct! [2022-11-25 17:49:00,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37baba39-5866-40e2-82c4-44d4d88d2362/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE