./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN --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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- 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-6b4ec56 [2022-11-20 12:02:58,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:02:58,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:02:58,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:02:58,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:02:58,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:02:58,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:02:58,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:02:58,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:02:58,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:02:58,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:02:58,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:02:58,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:02:58,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:02:58,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:02:58,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:02:58,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:02:58,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:02:58,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:02:58,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:02:58,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:02:58,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:02:58,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:02:58,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:02:58,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:02:58,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:02:58,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:02:58,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:02:58,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:02:58,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:02:58,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:02:58,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:02:58,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:02:58,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:02:58,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:02:58,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:02:58,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:02:58,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:02:58,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:02:58,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:02:58,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:02:58,902 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 12:02:58,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:02:58,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:02:58,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:02:58,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:02:58,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:02:58,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:02:58,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:02:58,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:02:58,949 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:02:58,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:02:58,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:02:58,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:02:58,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:02:58,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:02:58,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:02:58,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:02:58,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:02:58,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:02:58,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:02:58,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:02:58,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:02:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:02:58,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:02:58,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:02:58,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:02:58,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:02:58,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:02:58,957 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:02:58,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:02:58,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:02:58,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/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_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2022-11-20 12:02:59,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:02:59,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:02:59,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:02:59,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:02:59,334 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:02:59,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-11-20 12:03:02,464 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:03:03,042 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:03:03,047 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-11-20 12:03:03,082 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/data/fea39fb5a/0b0cf94741ab49ffb0a53194443f09af/FLAGf733e85ae [2022-11-20 12:03:03,104 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/data/fea39fb5a/0b0cf94741ab49ffb0a53194443f09af [2022-11-20 12:03:03,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:03:03,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:03:03,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:03:03,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:03:03,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:03:03,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:03" (1/1) ... [2022-11-20 12:03:03,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795adf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:03, skipping insertion in model container [2022-11-20 12:03:03,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:03" (1/1) ... [2022-11-20 12:03:03,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:03:03,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:03:03,554 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_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-11-20 12:03:03,564 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_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-11-20 12:03:04,793 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,794 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,795 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,796 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,797 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,813 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,814 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,816 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:04,817 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:05,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 12:03:05,361 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 12:03:05,363 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 12:03:05,365 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 12:03:05,367 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 12:03:05,368 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 12:03:05,369 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 12:03:05,370 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 12:03:05,371 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 12:03:05,372 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 12:03:05,633 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 12:03:05,738 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:05,739 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:05,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:03:05,917 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:03:05,957 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_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-11-20 12:03:05,959 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_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-11-20 12:03:06,011 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,012 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,013 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,014 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,015 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,029 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,030 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,033 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,033 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,104 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 12:03:06,105 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 12:03:06,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 12:03:06,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 12:03:06,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 12:03:06,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 12:03:06,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 12:03:06,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 12:03:06,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 12:03:06,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 12:03:06,155 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 12:03:06,223 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,224 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:03:06,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:03:06,527 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:03:06,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06 WrapperNode [2022-11-20 12:03:06,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:03:06,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:03:06,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:03:06,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:03:06,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,699 INFO L138 Inliner]: procedures = 690, calls = 2613, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2022-11-20 12:03:06,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:03:06,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:03:06,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:03:06,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:03:06,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,787 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:03:06,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:03:06,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:03:06,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:03:06,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (1/1) ... [2022-11-20 12:03:06,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:03:06,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:06,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:03:06,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:03:06,917 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-20 12:03:06,918 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-20 12:03:06,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:03:06,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:03:06,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 12:03:06,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 12:03:06,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:03:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:03:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:03:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:03:06,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:03:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-20 12:03:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-20 12:03:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 12:03:06,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 12:03:06,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:03:06,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:03:06,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 12:03:06,921 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-20 12:03:06,921 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-20 12:03:06,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:03:06,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:03:07,292 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:03:07,294 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:03:08,657 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:03:08,676 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:03:08,676 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:03:08,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:08 BoogieIcfgContainer [2022-11-20 12:03:08,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:03:08,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:03:08,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:03:08,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:03:08,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:03:03" (1/3) ... [2022-11-20 12:03:08,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651fb952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:03:08, skipping insertion in model container [2022-11-20 12:03:08,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:06" (2/3) ... [2022-11-20 12:03:08,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651fb952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:03:08, skipping insertion in model container [2022-11-20 12:03:08,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:08" (3/3) ... [2022-11-20 12:03:08,702 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2022-11-20 12:03:08,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:03:08,727 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:03:08,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:03:08,809 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;@72e9b209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:03:08,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:03:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 12:03:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 12:03:08,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:08,826 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:08,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1393308319, now seen corresponding path program 1 times [2022-11-20 12:03:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:08,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573066766] [2022-11-20 12:03:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:09,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573066766] [2022-11-20 12:03:09,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573066766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:09,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:09,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:03:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042413053] [2022-11-20 12:03:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:09,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:03:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:09,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:03:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:09,672 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:09,976 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2022-11-20 12:03:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:03:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-20 12:03:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:09,993 INFO L225 Difference]: With dead ends: 133 [2022-11-20 12:03:10,000 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 12:03:10,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-20 12:03:10,015 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:10,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 70 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 12:03:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-20 12:03:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 12:03:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2022-11-20 12:03:10,080 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 29 [2022-11-20 12:03:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:10,081 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2022-11-20 12:03:10,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-11-20 12:03:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 12:03:10,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:10,087 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:03:10,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 85103393, now seen corresponding path program 1 times [2022-11-20 12:03:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:10,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436715072] [2022-11-20 12:03:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:10,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:10,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436715072] [2022-11-20 12:03:10,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436715072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:03:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073083338] [2022-11-20 12:03:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:10,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:10,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:10,978 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:11,339 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-11-20 12:03:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-20 12:03:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:11,343 INFO L225 Difference]: With dead ends: 115 [2022-11-20 12:03:11,343 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 12:03:11,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-20 12:03:11,345 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 57 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:11,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 135 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:03:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 12:03:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 12:03:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-20 12:03:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2022-11-20 12:03:11,357 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 29 [2022-11-20 12:03:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:11,358 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2022-11-20 12:03:11,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-11-20 12:03:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 12:03:11,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:11,360 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:03:11,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -682621012, now seen corresponding path program 1 times [2022-11-20 12:03:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:11,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736589634] [2022-11-20 12:03:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:12,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736589634] [2022-11-20 12:03:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736589634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:12,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:12,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:03:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948149764] [2022-11-20 12:03:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:12,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:03:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:03:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:12,607 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:13,121 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-11-20 12:03:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:03:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-11-20 12:03:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:13,124 INFO L225 Difference]: With dead ends: 77 [2022-11-20 12:03:13,124 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 12:03:13,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 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-20 12:03:13,126 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:13,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 12:03:13,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-20 12:03:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2022-11-20 12:03:13,137 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 35 [2022-11-20 12:03:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:13,138 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2022-11-20 12:03:13,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2022-11-20 12:03:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:03:13,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:13,140 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:13,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:03:13,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash 834697204, now seen corresponding path program 1 times [2022-11-20 12:03:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208242915] [2022-11-20 12:03:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:14,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208242915] [2022-11-20 12:03:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208242915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:14,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:14,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:03:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49838683] [2022-11-20 12:03:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:14,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:03:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:03:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:03:14,747 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:15,295 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2022-11-20 12:03:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:03:15,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-20 12:03:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:15,298 INFO L225 Difference]: With dead ends: 156 [2022-11-20 12:03:15,298 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 12:03:15,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:03:15,299 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 100 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:15,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 147 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:03:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 12:03:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-11-20 12:03:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-11-20 12:03:15,317 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 39 [2022-11-20 12:03:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:15,318 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-11-20 12:03:15,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-11-20 12:03:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:03:15,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:15,321 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:15,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:03:15,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1092862642, now seen corresponding path program 1 times [2022-11-20 12:03:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:15,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194545964] [2022-11-20 12:03:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194545964] [2022-11-20 12:03:20,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194545964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:20,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:20,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:03:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764641162] [2022-11-20 12:03:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:03:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:03:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:03:20,318 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:21,985 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-11-20 12:03:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:03:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-20 12:03:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:21,987 INFO L225 Difference]: With dead ends: 168 [2022-11-20 12:03:21,987 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 12:03:21,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:03:21,989 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 179 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:21,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 136 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:03:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 12:03:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-20 12:03:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.203125) internal successors, (77), 67 states have internal predecessors, (77), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-11-20 12:03:22,018 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 39 [2022-11-20 12:03:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:22,019 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-11-20 12:03:22,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-11-20 12:03:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:03:22,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:22,021 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:22,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:03:22,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:22,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash -187001036, now seen corresponding path program 1 times [2022-11-20 12:03:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:22,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027633198] [2022-11-20 12:03:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:23,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027633198] [2022-11-20 12:03:23,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027633198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:23,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:03:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96294267] [2022-11-20 12:03:23,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:23,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:03:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:23,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:03:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:23,218 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:23,817 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-11-20 12:03:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:03:23,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-20 12:03:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:23,819 INFO L225 Difference]: With dead ends: 180 [2022-11-20 12:03:23,820 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 12:03:23,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:03:23,821 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 118 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:23,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 163 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:03:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 12:03:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2022-11-20 12:03:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2022-11-20 12:03:23,835 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 39 [2022-11-20 12:03:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:23,835 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2022-11-20 12:03:23,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2022-11-20 12:03:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:03:23,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:23,837 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:23,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:03:23,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -753650698, now seen corresponding path program 1 times [2022-11-20 12:03:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:23,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418115176] [2022-11-20 12:03:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:24,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:24,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:24,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418115176] [2022-11-20 12:03:24,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418115176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:24,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:24,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:03:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171120985] [2022-11-20 12:03:24,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:24,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:03:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:24,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:03:24,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:03:24,181 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:24,469 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2022-11-20 12:03:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-11-20 12:03:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:24,471 INFO L225 Difference]: With dead ends: 172 [2022-11-20 12:03:24,471 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 12:03:24,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:24,473 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:24,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 116 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 12:03:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2022-11-20 12:03:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 66 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2022-11-20 12:03:24,484 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 39 [2022-11-20 12:03:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:24,485 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-11-20 12:03:24,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-11-20 12:03:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:03:24,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:24,487 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:24,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:03:24,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2033514376, now seen corresponding path program 1 times [2022-11-20 12:03:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399216118] [2022-11-20 12:03:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:25,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399216118] [2022-11-20 12:03:25,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399216118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:25,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:25,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:03:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360652648] [2022-11-20 12:03:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:25,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:03:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:03:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:25,624 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:26,051 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2022-11-20 12:03:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:03:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-20 12:03:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:26,053 INFO L225 Difference]: With dead ends: 169 [2022-11-20 12:03:26,053 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 12:03:26,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:03:26,055 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:26,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 142 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:03:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 12:03:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2022-11-20 12:03:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.2) internal successors, (78), 68 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2022-11-20 12:03:26,064 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 39 [2022-11-20 12:03:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:26,065 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2022-11-20 12:03:26,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-11-20 12:03:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:03:26,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:26,066 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:26,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:03:26,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1775348938, now seen corresponding path program 1 times [2022-11-20 12:03:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:26,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042772491] [2022-11-20 12:03:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:26,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042772491] [2022-11-20 12:03:26,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042772491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:26,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:26,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:03:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391451936] [2022-11-20 12:03:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:26,936 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:27,308 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-11-20 12:03:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-11-20 12:03:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:27,310 INFO L225 Difference]: With dead ends: 168 [2022-11-20 12:03:27,310 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 12:03:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-20 12:03:27,311 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 64 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:27,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 111 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:03:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 12:03:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-11-20 12:03:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 66 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2022-11-20 12:03:27,319 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 39 [2022-11-20 12:03:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:27,320 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2022-11-20 12:03:27,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-11-20 12:03:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 12:03:27,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:27,321 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:27,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:03:27,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1543914243, now seen corresponding path program 1 times [2022-11-20 12:03:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:27,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834394540] [2022-11-20 12:03:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:28,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834394540] [2022-11-20 12:03:28,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834394540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:28,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:28,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:03:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907254807] [2022-11-20 12:03:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:28,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:03:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:03:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:03:28,325 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:28,881 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-11-20 12:03:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:03:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-20 12:03:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:28,883 INFO L225 Difference]: With dead ends: 109 [2022-11-20 12:03:28,883 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 12:03:28,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:03:28,884 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 70 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:28,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 12:03:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-20 12:03:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-20 12:03:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-11-20 12:03:28,895 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2022-11-20 12:03:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:28,896 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-11-20 12:03:28,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 12:03:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-11-20 12:03:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 12:03:28,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:28,899 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:28,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:03:28,900 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -842849665, now seen corresponding path program 1 times [2022-11-20 12:03:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:28,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304345646] [2022-11-20 12:03:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:29,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:30,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304345646] [2022-11-20 12:03:30,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304345646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:30,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:30,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:03:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189481983] [2022-11-20 12:03:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:30,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:03:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:03:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:30,117 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:30,546 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2022-11-20 12:03:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:03:30,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-20 12:03:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:30,547 INFO L225 Difference]: With dead ends: 171 [2022-11-20 12:03:30,548 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 12:03:30,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:03:30,549 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:30,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 163 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:03:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 12:03:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-11-20 12:03:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 62 states have internal predecessors, (71), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-20 12:03:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-11-20 12:03:30,554 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 41 [2022-11-20 12:03:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:30,557 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-11-20 12:03:30,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:03:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-11-20 12:03:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:03:30,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:30,559 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:30,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:03:30,560 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash -143563596, now seen corresponding path program 1 times [2022-11-20 12:03:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:30,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76745668] [2022-11-20 12:03:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:03:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:31,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76745668] [2022-11-20 12:03:31,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76745668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:31,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:31,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:03:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053040493] [2022-11-20 12:03:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:31,020 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 12:03:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:31,303 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-11-20 12:03:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:31,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-11-20 12:03:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:31,304 INFO L225 Difference]: With dead ends: 114 [2022-11-20 12:03:31,304 INFO L226 Difference]: Without dead ends: 82 [2022-11-20 12:03:31,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:31,305 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:31,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 105 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-20 12:03:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-20 12:03:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-20 12:03:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-11-20 12:03:31,316 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 48 [2022-11-20 12:03:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:31,317 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-11-20 12:03:31,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 12:03:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-11-20 12:03:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 12:03:31,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:31,319 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:31,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:03:31,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1027849983, now seen corresponding path program 1 times [2022-11-20 12:03:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:31,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203917007] [2022-11-20 12:03:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:03:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:32,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203917007] [2022-11-20 12:03:32,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203917007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:32,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:32,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:03:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446355611] [2022-11-20 12:03:32,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:32,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:03:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:03:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:32,163 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 12:03:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:32,569 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-11-20 12:03:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:03:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 54 [2022-11-20 12:03:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:32,570 INFO L225 Difference]: With dead ends: 98 [2022-11-20 12:03:32,570 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 12:03:32,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 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-20 12:03:32,571 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 59 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:32,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 226 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:03:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 12:03:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-11-20 12:03:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 12:03:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2022-11-20 12:03:32,578 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 54 [2022-11-20 12:03:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:32,578 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2022-11-20 12:03:32,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 12:03:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2022-11-20 12:03:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:03:32,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:32,581 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:32,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:03:32,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1667671931, now seen corresponding path program 1 times [2022-11-20 12:03:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:32,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044920075] [2022-11-20 12:03:32,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:03:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:35,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044920075] [2022-11-20 12:03:35,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044920075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:35,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878346003] [2022-11-20 12:03:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:35,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:35,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:35,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:35,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:03:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:36,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 12:03:36,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:03:38,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:38,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878346003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:38,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:03:38,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-11-20 12:03:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214007223] [2022-11-20 12:03:38,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 12:03:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 12:03:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2022-11-20 12:03:38,964 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-20 12:03:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:41,299 INFO L93 Difference]: Finished difference Result 180 states and 219 transitions. [2022-11-20 12:03:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 12:03:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 58 [2022-11-20 12:03:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:41,301 INFO L225 Difference]: With dead ends: 180 [2022-11-20 12:03:41,301 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 12:03:41,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=436, Invalid=2114, Unknown=0, NotChecked=0, Total=2550 [2022-11-20 12:03:41,304 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 203 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:41,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 247 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 476 Invalid, 0 Unknown, 240 Unchecked, 0.6s Time] [2022-11-20 12:03:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 12:03:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 121. [2022-11-20 12:03:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 95 states have internal predecessors, (105), 17 states have call successors, (17), 9 states have call predecessors, (17), 12 states have return successors, (24), 16 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-20 12:03:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2022-11-20 12:03:41,318 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 58 [2022-11-20 12:03:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:41,319 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2022-11-20 12:03:41,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-20 12:03:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2022-11-20 12:03:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:03:41,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:41,321 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:41,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:41,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 12:03:41,534 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1347431687, now seen corresponding path program 1 times [2022-11-20 12:03:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:41,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048041700] [2022-11-20 12:03:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:03:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:43,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048041700] [2022-11-20 12:03:43,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048041700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:43,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:43,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:03:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217152450] [2022-11-20 12:03:43,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:03:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:03:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:03:43,217 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:03:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:43,847 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-11-20 12:03:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:03:43,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-20 12:03:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:43,849 INFO L225 Difference]: With dead ends: 168 [2022-11-20 12:03:43,849 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 12:03:43,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:03:43,850 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 148 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:43,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 111 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:03:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 12:03:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2022-11-20 12:03:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 86 states have internal predecessors, (93), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 12:03:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2022-11-20 12:03:43,865 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 58 [2022-11-20 12:03:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:43,866 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2022-11-20 12:03:43,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:03:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2022-11-20 12:03:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:03:43,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:43,868 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:43,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:03:43,868 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -499081653, now seen corresponding path program 1 times [2022-11-20 12:03:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:43,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197759919] [2022-11-20 12:03:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:03:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:45,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197759919] [2022-11-20 12:03:45,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197759919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:45,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:45,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:03:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171241468] [2022-11-20 12:03:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:45,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:03:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:03:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:03:45,405 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:03:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:46,014 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2022-11-20 12:03:46,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:03:46,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-20 12:03:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:46,016 INFO L225 Difference]: With dead ends: 150 [2022-11-20 12:03:46,016 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 12:03:46,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:03:46,017 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:46,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 111 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:03:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 12:03:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-11-20 12:03:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.108433734939759) internal successors, (92), 86 states have internal predecessors, (92), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 12:03:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2022-11-20 12:03:46,027 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 58 [2022-11-20 12:03:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:46,028 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2022-11-20 12:03:46,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:03:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2022-11-20 12:03:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 12:03:46,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:46,029 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-20 12:03:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:03:46,030 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 592257393, now seen corresponding path program 1 times [2022-11-20 12:03:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:46,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991726123] [2022-11-20 12:03:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:03:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 12:03:47,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:47,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991726123] [2022-11-20 12:03:47,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991726123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:47,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:47,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:03:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566507297] [2022-11-20 12:03:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:47,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:03:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:03:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:47,227 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 12:03:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:47,732 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2022-11-20 12:03:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:03:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2022-11-20 12:03:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:47,736 INFO L225 Difference]: With dead ends: 118 [2022-11-20 12:03:47,736 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 12:03:47,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:03:47,738 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:47,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 12:03:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-20 12:03:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 89 states have internal predecessors, (95), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 12:03:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2022-11-20 12:03:47,755 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 60 [2022-11-20 12:03:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:47,755 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2022-11-20 12:03:47,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 12:03:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2022-11-20 12:03:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 12:03:47,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:47,757 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:47,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:03:47,757 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1522393654, now seen corresponding path program 1 times [2022-11-20 12:03:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:47,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874113636] [2022-11-20 12:03:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:48,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:48,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:03:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:48,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874113636] [2022-11-20 12:03:48,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874113636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:48,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:48,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:03:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912933379] [2022-11-20 12:03:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:48,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:03:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:03:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:03:48,062 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 12:03:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:48,342 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2022-11-20 12:03:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:03:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2022-11-20 12:03:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:48,348 INFO L225 Difference]: With dead ends: 155 [2022-11-20 12:03:48,348 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 12:03:48,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:03:48,349 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:48,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 12:03:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-20 12:03:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 85 states have internal predecessors, (88), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 12:03:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-11-20 12:03:48,362 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 60 [2022-11-20 12:03:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:48,363 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-11-20 12:03:48,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 12:03:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-11-20 12:03:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 12:03:48,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:48,365 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:48,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:03:48,365 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 506399248, now seen corresponding path program 1 times [2022-11-20 12:03:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:48,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485442582] [2022-11-20 12:03:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:03:49,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:49,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485442582] [2022-11-20 12:03:49,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485442582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:49,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:49,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:03:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891249833] [2022-11-20 12:03:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:03:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:03:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:03:49,375 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 12:03:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:49,914 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-11-20 12:03:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:03:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2022-11-20 12:03:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:49,916 INFO L225 Difference]: With dead ends: 120 [2022-11-20 12:03:49,916 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 12:03:49,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:03:49,918 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:49,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 286 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 12:03:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2022-11-20 12:03:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 85 states have internal predecessors, (88), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 12:03:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-11-20 12:03:49,931 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 60 [2022-11-20 12:03:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:49,931 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-11-20 12:03:49,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 12:03:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-11-20 12:03:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 12:03:49,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:49,933 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:49,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:03:49,934 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:49,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1207463826, now seen corresponding path program 1 times [2022-11-20 12:03:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:49,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93333730] [2022-11-20 12:03:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:03:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93333730] [2022-11-20 12:03:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93333730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:51,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:51,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:03:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156013361] [2022-11-20 12:03:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:03:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:51,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:03:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:03:51,426 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:03:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:52,041 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-11-20 12:03:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:03:52,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-11-20 12:03:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:52,043 INFO L225 Difference]: With dead ends: 145 [2022-11-20 12:03:52,044 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 12:03:52,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:03:52,045 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 90 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:52,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 100 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:03:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 12:03:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-20 12:03:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-20 12:03:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-20 12:03:52,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 60 [2022-11-20 12:03:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:52,062 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-20 12:03:52,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:03:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-20 12:03:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 12:03:52,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:52,064 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-20 12:03:52,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:03:52,064 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1397895009, now seen corresponding path program 1 times [2022-11-20 12:03:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:52,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720245526] [2022-11-20 12:03:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:03:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:03:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:03:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:03:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:03:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:53,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720245526] [2022-11-20 12:03:53,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720245526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:53,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:53,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:03:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023237056] [2022-11-20 12:03:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:53,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:03:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:53,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:03:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:03:53,397 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 12:03:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:54,056 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-11-20 12:03:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:03:54,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-11-20 12:03:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:54,057 INFO L225 Difference]: With dead ends: 112 [2022-11-20 12:03:54,058 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 12:03:54,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:03:54,059 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:54,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 118 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:03:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 12:03:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-20 12:03:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.0625) internal successors, (85), 82 states have internal predecessors, (85), 17 states have call successors, (17), 11 states have call predecessors, (17), 12 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-20 12:03:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-11-20 12:03:54,072 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 66 [2022-11-20 12:03:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:54,073 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-11-20 12:03:54,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 12:03:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-11-20 12:03:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 12:03:54,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:54,075 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:03:54,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:03:54,075 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2018654228, now seen corresponding path program 1 times [2022-11-20 12:03:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:54,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901966354] [2022-11-20 12:03:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:03:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:03:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 12:03:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:03:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:03:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901966354] [2022-11-20 12:03:58,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901966354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930046214] [2022-11-20 12:03:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:58,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:58,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:03:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:59,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 12:03:59,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:59,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:59,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:59,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-20 12:04:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:04:00,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:00,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930046214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:00,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:04:00,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2022-11-20 12:04:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699549070] [2022-11-20 12:04:00,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 12:04:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:04:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2022-11-20 12:04:00,498 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-20 12:04:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:01,773 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2022-11-20 12:04:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:04:01,774 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 64 [2022-11-20 12:04:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:01,775 INFO L225 Difference]: With dead ends: 198 [2022-11-20 12:04:01,775 INFO L226 Difference]: Without dead ends: 145 [2022-11-20 12:04:01,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 12:04:01,777 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 125 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:01,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 177 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 427 Invalid, 0 Unknown, 193 Unchecked, 0.6s Time] [2022-11-20 12:04:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-20 12:04:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 82. [2022-11-20 12:04:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 14 states have call successors, (14), 9 states have call predecessors, (14), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 12:04:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-20 12:04:01,790 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 64 [2022-11-20 12:04:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:01,790 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-20 12:04:01,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-20 12:04:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-20 12:04:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 12:04:01,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:01,792 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-20 12:04:01,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:04:02,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:02,003 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash -134753713, now seen corresponding path program 1 times [2022-11-20 12:04:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:02,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625894156] [2022-11-20 12:04:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:04:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:04:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:04:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:04:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:04:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:04:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:04:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 12:04:03,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625894156] [2022-11-20 12:04:03,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625894156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:03,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:03,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:04:03,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588143140] [2022-11-20 12:04:03,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:03,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:04:03,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:03,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:04:03,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:04:03,268 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-20 12:04:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:03,724 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-11-20 12:04:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:04:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-11-20 12:04:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:03,725 INFO L225 Difference]: With dead ends: 88 [2022-11-20 12:04:03,725 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 12:04:03,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:04:03,726 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:03,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 129 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:04:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 12:04:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-20 12:04:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 62 states have internal predecessors, (64), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 12:04:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-20 12:04:03,739 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 72 [2022-11-20 12:04:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:03,739 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-20 12:04:03,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-20 12:04:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-20 12:04:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-20 12:04:03,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:03,741 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2022-11-20 12:04:03,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 12:04:03,741 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1256277667, now seen corresponding path program 1 times [2022-11-20 12:04:03,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:03,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323104220] [2022-11-20 12:04:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:03,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:04:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:04:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 12:04:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:04:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:04:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:04:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:04:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:04:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 12:04:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323104220] [2022-11-20 12:04:04,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323104220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870599452] [2022-11-20 12:04:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:04,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:04,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:05,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:04:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:05,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 12:04:05,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:06,880 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:04:06,880 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 30 treesize of output 10 [2022-11-20 12:04:06,886 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:04:06,887 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 30 treesize of output 10 [2022-11-20 12:04:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 12:04:06,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:07,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870599452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:07,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:04:07,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-11-20 12:04:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711408413] [2022-11-20 12:04:07,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:07,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 12:04:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 12:04:07,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:04:07,274 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-20 12:04:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:08,289 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2022-11-20 12:04:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 12:04:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 79 [2022-11-20 12:04:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:08,291 INFO L225 Difference]: With dead ends: 182 [2022-11-20 12:04:08,291 INFO L226 Difference]: Without dead ends: 82 [2022-11-20 12:04:08,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 129 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-11-20 12:04:08,293 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:08,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 332 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 405 Invalid, 0 Unknown, 195 Unchecked, 0.5s Time] [2022-11-20 12:04:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-20 12:04:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-20 12:04:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 58 states have internal predecessors, (58), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 12:04:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-11-20 12:04:08,306 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 79 [2022-11-20 12:04:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:08,306 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-11-20 12:04:08,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-20 12:04:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-11-20 12:04:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 12:04:08,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:08,308 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 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] [2022-11-20 12:04:08,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:04:08,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 12:04:08,520 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1365917757, now seen corresponding path program 1 times [2022-11-20 12:04:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:08,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345944446] [2022-11-20 12:04:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:04:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:04:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 12:04:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:04:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:04:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:04:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:04:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 12:04:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-20 12:04:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345944446] [2022-11-20 12:04:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345944446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:09,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:09,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:04:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77084079] [2022-11-20 12:04:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:04:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:04:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:04:09,723 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:04:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:10,182 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-11-20 12:04:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:04:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2022-11-20 12:04:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:10,183 INFO L225 Difference]: With dead ends: 88 [2022-11-20 12:04:10,183 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 12:04:10,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:04:10,184 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:10,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 198 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:04:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 12:04:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 12:04:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 12:04:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-11-20 12:04:10,202 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 91 [2022-11-20 12:04:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:10,204 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-11-20 12:04:10,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 12:04:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-11-20 12:04:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-20 12:04:10,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:10,206 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 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-20 12:04:10,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 12:04:10,207 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1936668706, now seen corresponding path program 1 times [2022-11-20 12:04:10,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:10,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726513774] [2022-11-20 12:04:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:04:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:04:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 12:04:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:04:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:04:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:04:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:04:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 12:04:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:04:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:04:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 12:04:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-20 12:04:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726513774] [2022-11-20 12:04:13,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726513774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:13,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:13,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:04:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311726017] [2022-11-20 12:04:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:13,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:04:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:04:13,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:04:13,966 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 12:04:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:15,237 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-11-20 12:04:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:04:15,238 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 108 [2022-11-20 12:04:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:15,238 INFO L225 Difference]: With dead ends: 84 [2022-11-20 12:04:15,238 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:04:15,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-11-20 12:04:15,240 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:15,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 156 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:04:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:04:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:04:15,244 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-20 12:04:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:04:15,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2022-11-20 12:04:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:15,249 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:04:15,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 12:04:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:04:15,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:04:15,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:04:15,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 12:04:15,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:04:18,934 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-20 12:04:18,934 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-20 12:04:18,934 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-20 12:04:18,935 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-20 12:04:18,935 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-20 12:04:18,935 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-11-20 12:04:18,935 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-11-20 12:04:18,935 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-11-20 12:04:18,935 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,935 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,935 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,936 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,937 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,938 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,938 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,938 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-11-20 12:04:18,938 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-20 12:04:18,939 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-20 12:04:18,939 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 12:04:18,939 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-20 12:04:18,939 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-20 12:04:18,939 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-20 12:04:18,940 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-20 12:04:18,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:04:18,940 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-20 12:04:18,940 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2022-11-20 12:04:18,941 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2022-11-20 12:04:18,941 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-20 12:04:18,941 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-20 12:04:18,942 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8))) (let ((.cse4 (select .cse0 .cse8)) (.cse5 (= (select .cse3 .cse8) 0)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24)) (.cse7 (select .cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse6 (and (= .cse4 0) .cse5))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= 0 (select .cse0 .cse1)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse3 .cse1) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (or (and (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5) .cse6) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (or (<= .cse7 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)))) .cse6) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2022-11-20 12:04:18,943 INFO L902 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: true [2022-11-20 12:04:18,943 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2022-11-20 12:04:18,947 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse9 (= (select .cse21 .cse19) 0)) (.cse8 (select .cse21 .cse20)) (.cse3 (select .cse18 .cse20)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= 0 (select .cse18 .cse19))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (= .cse3 0) .cse4 (let ((.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse17 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse16 0) (= .cse17 .cse8) (= .cse16 .cse3) (= .cse17 0)))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-11-20 12:04:18,947 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-20 12:04:18,947 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2022-11-20 12:04:18,951 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-20 12:04:18,956 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2022-11-20 12:04:18,957 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse21 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse10 (select .cse17 .cse20)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse9 (select .cse19 .cse20)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1202#1| 0)) (.cse6 (= (select .cse19 .cse18) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= 0 (select .cse17 .cse18))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse7 0) (= .cse8 .cse9) (= .cse7 .cse10) (= .cse8 0)))) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= .cse10 0) .cse2 (let ((.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse16))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15)))) [2022-11-20 12:04:18,957 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8))) (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse14 (select .cse19 .cse20))) (let ((.cse4 (= .cse14 0)) (.cse11 (= (select .cse16 .cse20) 0)) (.cse15 (select .cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse1 (= 0 (select .cse19 .cse17))) (.cse2 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1| 1)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1|)) (.cse5 (= (select .cse18 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse6 (= (select .cse16 .cse17) 0)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (= .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (or (<= .cse15 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse15) 18446744073709551616)))) (and .cse4 .cse11))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (= .cse14 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 .cse3 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse11 .cse12 .cse13)))))) [2022-11-20 12:04:18,958 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2022-11-20 12:04:18,958 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:04:18,958 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:04:18,958 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:04:18,958 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-20 12:04:18,959 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2022-11-20 12:04:18,959 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2022-11-20 12:04:18,959 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2022-11-20 12:04:18,959 INFO L902 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2022-11-20 12:04:18,960 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1201#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse9 (= (select .cse21 .cse19) 0)) (.cse8 (select .cse21 .cse20)) (.cse3 (select .cse18 .cse20)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse13 (= 0 (select .cse18 .cse19))) (.cse14 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1201#1| 1)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (= .cse3 0) .cse4 (let ((.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse17 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse16 0) (= .cse17 .cse8) (= .cse16 .cse3) (= .cse17 0)))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-11-20 12:04:18,960 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= (+ |ULTIMATE.start_assert_bytes_match_#t~mem585#1| (* 256 (div |ULTIMATE.start_assert_bytes_match_#t~mem584#1| 256))) (+ |ULTIMATE.start_assert_bytes_match_#t~mem584#1| (* (div |ULTIMATE.start_assert_bytes_match_#t~mem585#1| 256) 256))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-20 12:04:18,961 INFO L895 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse2 (let ((.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse6 .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse8 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (<= 1 (+ .cse8 (* (div (+ 18446744073709551615 (- .cse8)) 18446744073709551616) 18446744073709551616))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse8)))) .cse9 .cse10 .cse11) (and .cse6 .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7| Int)) (let ((.cse12 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7|) 8)) (.cse13 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7|) 8))) (and (= .cse12 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse12 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse13) (= .cse13 0)))) .cse9 .cse10 .cse11)))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0))) (or (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse1))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0)) (and .cse0 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse5 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse4 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse4) (= .cse5 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse5 0)))) .cse3))) [2022-11-20 12:04:18,961 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2022-11-20 12:04:18,962 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-20 12:04:18,962 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse21 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse10 (select .cse17 .cse20)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1203#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (select .cse19 .cse20)) (.cse6 (= (select .cse19 .cse18) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= 0 (select .cse17 .cse18))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse7 0) (= .cse8 .cse9) (= .cse7 .cse10) (= .cse8 0)))) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= .cse10 0) .cse2 (let ((.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse16))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 .cse5 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15)))) [2022-11-20 12:04:18,963 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-11-20 12:04:18,963 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse22 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (select .cse11 .cse23))) (let ((.cse9 (= .cse6 0)) (.cse5 (select .cse22 .cse23)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 .cse12) 0)) (.cse2 (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse20 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)))) (let ((.cse13 (= (select .cse21 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (= .cse20 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse13 .cse9 .cse14 .cse15 .cse16 (= .cse5 0) .cse17 .cse18 .cse19) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= .cse20 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse20) 18446744073709551616)))) .cse19)))))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse8 (= 0 (select .cse11 .cse12)))) (or (and .cse0 .cse1 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse3 0) (= .cse4 .cse5) (= .cse3 .cse6) (= .cse4 0)))) .cse7 .cse8) (and .cse0 .cse9 (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= .cse5 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse1 .cse2 .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse8)))))) [2022-11-20 12:04:18,964 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-20 12:04:18,964 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-20 12:04:18,964 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-20 12:04:18,964 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-20 12:04:18,964 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-20 12:04:18,965 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-20 12:04:18,965 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-20 12:04:18,972 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:18,975 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:04:18,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,995 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:18,995 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:18,996 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:18,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:18,997 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:18,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:18,998 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:18,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:18,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:18,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:18,999 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,007 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,008 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,009 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,010 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,015 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,016 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,016 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,017 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,017 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,018 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,018 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,039 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,042 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,042 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,043 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,043 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,043 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,044 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,044 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,045 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,045 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,046 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,046 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,048 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,048 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,051 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,052 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,053 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,053 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,054 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,055 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,055 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,056 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,056 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,057 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,058 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:04:19 BoogieIcfgContainer [2022-11-20 12:04:19,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:04:19,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:04:19,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:04:19,063 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:04:19,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:08" (3/4) ... [2022-11-20 12:04:19,067 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:04:19,076 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-20 12:04:19,076 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-20 12:04:19,076 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-20 12:04:19,077 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 12:04:19,077 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 12:04:19,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-11-20 12:04:19,102 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-11-20 12:04:19,104 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-20 12:04:19,106 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-20 12:04:19,107 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 12:04:19,108 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 12:04:19,109 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:04:19,111 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:04:19,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (aws_byte_buf_from_empty_array_#res#1.buffer == array && aws_byte_buf_from_empty_array_#res#1.buffer == 0))) && array == 0) && bytes == array) && ((((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: 1 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] + (18446744073709551615 + -unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16]) / 18446744073709551616 * 18446744073709551616 && unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16])) && !(buf == 0)) && capacity == capacity) && buf == 0) || (((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == aws_byte_buf_from_empty_array_#res#1.buffer && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0)) && !(buf == 0)) && capacity == capacity) && buf == 0))) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && bytes == 0) || (((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && ((((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: 1 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] + (18446744073709551615 + -unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16]) / 18446744073709551616 * 18446744073709551616 && unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16])) && !(buf == 0)) && capacity == capacity) && buf == 0) || (((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == aws_byte_buf_from_empty_array_#res#1.buffer && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0)) && !(buf == 0)) && capacity == capacity) && buf == 0))) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == aws_byte_buf_from_empty_array_#res#1.buffer) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) [2022-11-20 12:04:19,813 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:04:19,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:04:19,815 INFO L158 Benchmark]: Toolchain (without parser) took 76705.82ms. Allocated memory was 213.9MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 171.6MB in the beginning and 637.5MB in the end (delta: -465.9MB). Peak memory consumption was 419.8MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,815 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:04:19,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3416.94ms. Allocated memory is still 213.9MB. Free memory was 171.6MB in the beginning and 144.2MB in the end (delta: 27.4MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 170.43ms. Allocated memory is still 213.9MB. Free memory was 144.2MB in the beginning and 132.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,816 INFO L158 Benchmark]: Boogie Preprocessor took 116.45ms. Allocated memory is still 213.9MB. Free memory was 132.7MB in the beginning and 126.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,816 INFO L158 Benchmark]: RCFGBuilder took 1861.82ms. Allocated memory was 213.9MB in the beginning and 287.3MB in the end (delta: 73.4MB). Free memory was 126.4MB in the beginning and 214.6MB in the end (delta: -88.3MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,816 INFO L158 Benchmark]: TraceAbstraction took 70379.49ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 811.6MB). Free memory was 213.6MB in the beginning and 767.6MB in the end (delta: -554.0MB). Peak memory consumption was 256.6MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,817 INFO L158 Benchmark]: Witness Printer took 751.61ms. Allocated memory is still 1.1GB. Free memory was 767.6MB in the beginning and 637.5MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-20 12:04:19,818 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.32ms. Allocated memory is still 142.6MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3416.94ms. Allocated memory is still 213.9MB. Free memory was 171.6MB in the beginning and 144.2MB in the end (delta: 27.4MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 170.43ms. Allocated memory is still 213.9MB. Free memory was 144.2MB in the beginning and 132.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.45ms. Allocated memory is still 213.9MB. Free memory was 132.7MB in the beginning and 126.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1861.82ms. Allocated memory was 213.9MB in the beginning and 287.3MB in the end (delta: 73.4MB). Free memory was 126.4MB in the beginning and 214.6MB in the end (delta: -88.3MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. * TraceAbstraction took 70379.49ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 811.6MB). Free memory was 213.6MB in the beginning and 767.6MB in the end (delta: -554.0MB). Peak memory consumption was 256.6MB. Max. memory is 16.1GB. * Witness Printer took 751.61ms. Allocated memory is still 1.1GB. Free memory was 767.6MB in the beginning and 637.5MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,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_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,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_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * 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 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.2s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2140 mSDsluCounter, 4232 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 628 IncrementalHoareTripleChecker+Unchecked, 3207 mSDsCounter, 569 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8959 IncrementalHoareTripleChecker+Invalid, 10156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 569 mSolverCounterUnsat, 1025 mSDtfsCounter, 8959 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 998 GetRequests, 603 SyntacticMatches, 21 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=14, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 225 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 195 PreInvPairs, 220 NumberOfFragments, 2578 HoareAnnotationTreeSize, 195 FomulaSimplifications, 1824 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 3308 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 1606 NumberOfCodeBlocks, 1606 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1577 ConstructedInterpolants, 81 QuantifiedInterpolants, 9636 SizeOfPredicates, 40 NumberOfNonLiveVariables, 7512 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 578/638 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: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2022-11-20 12:04:19,834 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,834 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,834 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,835 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,835 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,835 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,836 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,836 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,837 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,837 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,837 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,838 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,839 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,840 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,840 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,841 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,841 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,842 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,842 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,843 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,843 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,844 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,845 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,845 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,846 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,846 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,846 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,846 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,847 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,847 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,848 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,848 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,848 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,848 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,849 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,849 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,849 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,849 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,850 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,850 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,850 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,850 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,850 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-20 12:04:19,851 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,851 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,851 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,851 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,852 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,852 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,852 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,852 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,853 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7,QUANTIFIED] [2022-11-20 12:04:19,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,853 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,853 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:04:19,854 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,854 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,854 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-20 12:04:19,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:04:19,855 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-20 12:04:19,855 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (aws_byte_buf_from_empty_array_#res#1.buffer == array && aws_byte_buf_from_empty_array_#res#1.buffer == 0))) && array == 0) && bytes == array) && ((((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: 1 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] + (18446744073709551615 + -unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16]) / 18446744073709551616 * 18446744073709551616 && unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16])) && !(buf == 0)) && capacity == capacity) && buf == 0) || (((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == aws_byte_buf_from_empty_array_#res#1.buffer && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0)) && !(buf == 0)) && capacity == capacity) && buf == 0))) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && bytes == 0) || (((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && ((((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: 1 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] + (18446744073709551615 + -unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16]) / 18446744073709551616 * 18446744073709551616 && unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16])) && !(buf == 0)) && capacity == capacity) && buf == 0) || (((((unknown-#res!capacity-unknown == capacity && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == aws_byte_buf_from_empty_array_#res#1.buffer && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_7][8] == 0)) && !(buf == 0)) && capacity == capacity) && buf == 0))) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == aws_byte_buf_from_empty_array_#res#1.buffer) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 12:04:19,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2068fe2a-e202-4dcf-bbb5-8eb611ac9452/bin/uautomizer-ug76WZFUDN/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