./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 926c219674f55200b40d9809e5b1fdaded5b761814321598aab4b2039c1325ea --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:09:05,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:09:05,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:09:05,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:09:05,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:09:05,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:09:05,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:09:05,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:09:05,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:09:05,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:09:05,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:09:05,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:09:05,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:09:05,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:09:05,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:09:05,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:09:05,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:09:05,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:09:05,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:09:05,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:09:05,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:09:05,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:09:05,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:09:05,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:09:05,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:09:05,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:09:05,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:09:05,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:09:05,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:09:05,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:09:05,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:09:05,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:09:05,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:09:05,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:09:05,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:09:05,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:09:05,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:09:05,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:09:05,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:09:05,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:09:05,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:09:05,643 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:09:05,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:09:05,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:09:05,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:09:05,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:09:05,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:09:05,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:09:05,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:09:05,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:09:05,681 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:09:05,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:09:05,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:09:05,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:09:05,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:09:05,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:09:05,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:09:05,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:09:05,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:09:05,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:09:05,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:09:05,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:09:05,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:09:05,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:09:05,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:09:05,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:09:05,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:09:05,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:09:05,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:09:05,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:09:05,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:09:05,687 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:09:05,688 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:09:05,688 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 926c219674f55200b40d9809e5b1fdaded5b761814321598aab4b2039c1325ea [2022-11-25 18:09:05,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:09:06,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:09:06,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:09:06,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:09:06,011 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:09:06,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-11-25 18:09:09,109 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:09:09,724 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:09:09,727 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-11-25 18:09:09,772 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data/4aec77441/192ce8a7d5b74c5e955f5e3173acfe65/FLAGc4368bcf2 [2022-11-25 18:09:09,794 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data/4aec77441/192ce8a7d5b74c5e955f5e3173acfe65 [2022-11-25 18:09:09,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:09:09,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:09:09,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:09:09,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:09:09,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:09:09,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:09:09" (1/1) ... [2022-11-25 18:09:09,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96629cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:09, skipping insertion in model container [2022-11-25 18:09:09,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:09:09" (1/1) ... [2022-11-25 18:09:09,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:09:09,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:09:10,225 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-11-25 18:09:10,236 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-11-25 18:09:11,435 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,436 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,437 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,438 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,439 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,457 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,458 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,460 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,461 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:11,570 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:09:11,571 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:09:11,572 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:09:11,577 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:09:11,580 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:09:11,580 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:09:12,057 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:09:12,058 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:09:12,060 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:09:12,061 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:09:12,062 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:09:12,063 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:09:12,064 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:09:12,065 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:09:12,066 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:09:12,066 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:09:12,067 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:09:12,287 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:09:12,329 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:09:12,341 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:09:12,373 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:09:12,383 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,383 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,449 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:09:12,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:09:12,503 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:09:12,517 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-11-25 18:09:12,518 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-11-25 18:09:12,559 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,567 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,568 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,569 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,569 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,577 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,591 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,592 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,593 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,600 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:09:12,613 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:09:12,614 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:09:12,618 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:09:12,619 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:09:12,620 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:09:12,715 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:09:12,717 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:09:12,719 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:09:12,720 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:09:12,755 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:09:12,756 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:09:12,757 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:09:12,760 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:09:12,761 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:09:12,762 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:09:12,763 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:09:12,798 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:09:12,827 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:09:12,840 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:09:12,861 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:09:12,874 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,876 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:09:12,919 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:09:12,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:09:13,204 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:09:13,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13 WrapperNode [2022-11-25 18:09:13,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:09:13,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:09:13,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:09:13,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:09:13,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,378 INFO L138 Inliner]: procedures = 690, calls = 2621, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 823 [2022-11-25 18:09:13,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:09:13,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:09:13,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:09:13,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:09:13,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:09:13,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:09:13,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:09:13,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:09:13,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (1/1) ... [2022-11-25 18:09:13,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:09:13,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:09:13,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:09:13,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:09:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-25 18:09:13,531 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-25 18:09:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:09:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 18:09:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 18:09:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:09:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:09:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:09:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:09:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:09:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:09:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:09:13,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:09:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 18:09:13,535 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 18:09:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:09:13,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:09:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:09:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:09:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:09:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:09:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:09:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:09:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:09:13,847 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:09:13,849 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:09:15,232 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:09:15,239 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:09:15,239 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:09:15,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:09:15 BoogieIcfgContainer [2022-11-25 18:09:15,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:09:15,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:09:15,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:09:15,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:09:15,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:09:09" (1/3) ... [2022-11-25 18:09:15,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c59c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:09:15, skipping insertion in model container [2022-11-25 18:09:15,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:09:13" (2/3) ... [2022-11-25 18:09:15,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c59c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:09:15, skipping insertion in model container [2022-11-25 18:09:15,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:09:15" (3/3) ... [2022-11-25 18:09:15,256 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_c_str_harness.i [2022-11-25 18:09:15,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:09:15,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:09:15,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:09:15,359 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;@156531d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:09:15,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:09:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 60 states have internal predecessors, (73), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:09:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:09:15,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:15,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:15,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1479345354, now seen corresponding path program 1 times [2022-11-25 18:09:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:15,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731979414] [2022-11-25 18:09:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:16,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731979414] [2022-11-25 18:09:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731979414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:16,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:16,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:09:16,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816902773] [2022-11-25 18:09:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:16,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:09:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:09:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:09:16,694 INFO L87 Difference]: Start difference. First operand has 87 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 60 states have internal predecessors, (73), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:16,760 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2022-11-25 18:09:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:09:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-25 18:09:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:16,772 INFO L225 Difference]: With dead ends: 167 [2022-11-25 18:09:16,773 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 18:09:16,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:09:16,780 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 18 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:16,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 312 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:09:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 18:09:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-25 18:09:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-11-25 18:09:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-11-25 18:09:16,844 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 18 [2022-11-25 18:09:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:16,844 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-11-25 18:09:16,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-11-25 18:09:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:09:16,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:16,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:09:16,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -409891947, now seen corresponding path program 1 times [2022-11-25 18:09:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869249546] [2022-11-25 18:09:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:18,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869249546] [2022-11-25 18:09:18,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869249546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:18,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:18,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660214272] [2022-11-25 18:09:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:18,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:18,070 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:09:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:18,225 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-11-25 18:09:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:09:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-25 18:09:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:18,231 INFO L225 Difference]: With dead ends: 94 [2022-11-25 18:09:18,231 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 18:09:18,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:18,236 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:18,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 653 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:09:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 18:09:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-11-25 18:09:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 21 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-11-25 18:09:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2022-11-25 18:09:18,253 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 24 [2022-11-25 18:09:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:18,254 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2022-11-25 18:09:18,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:09:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-11-25 18:09:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:09:18,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:18,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:18,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:09:18,256 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash 113995101, now seen corresponding path program 1 times [2022-11-25 18:09:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:18,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287606784] [2022-11-25 18:09:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:19,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:19,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:20,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:20,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287606784] [2022-11-25 18:09:20,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287606784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:20,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:20,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:09:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887943615] [2022-11-25 18:09:20,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:20,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:09:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:09:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:09:20,179 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:20,491 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2022-11-25 18:09:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:09:20,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:09:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:20,493 INFO L225 Difference]: With dead ends: 185 [2022-11-25 18:09:20,493 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 18:09:20,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:09:20,494 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 62 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:20,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 441 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:09:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 18:09:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2022-11-25 18:09:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 69 states have internal predecessors, (78), 21 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-11-25 18:09:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2022-11-25 18:09:20,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2022-11-25 18:09:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:20,528 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2022-11-25 18:09:20,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-11-25 18:09:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:09:20,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:20,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:20,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:09:20,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 372160539, now seen corresponding path program 1 times [2022-11-25 18:09:20,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:20,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581696743] [2022-11-25 18:09:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581696743] [2022-11-25 18:09:22,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581696743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:22,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:22,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535226] [2022-11-25 18:09:22,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:22,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:22,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:22,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:22,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:22,971 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:23,357 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2022-11-25 18:09:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:09:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:09:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:23,359 INFO L225 Difference]: With dead ends: 187 [2022-11-25 18:09:23,360 INFO L226 Difference]: Without dead ends: 118 [2022-11-25 18:09:23,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:23,361 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 52 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:23,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 568 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:09:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-25 18:09:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-11-25 18:09:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.225) internal successors, (98), 86 states have internal predecessors, (98), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (26), 19 states have call predecessors, (26), 20 states have call successors, (26) [2022-11-25 18:09:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-11-25 18:09:23,375 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 28 [2022-11-25 18:09:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:23,375 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-11-25 18:09:23,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-11-25 18:09:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:09:23,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:23,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:23,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:09:23,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -907703139, now seen corresponding path program 1 times [2022-11-25 18:09:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:23,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026476068] [2022-11-25 18:09:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:24,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026476068] [2022-11-25 18:09:24,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026476068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:24,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:24,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:09:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5957028] [2022-11-25 18:09:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:24,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:09:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:09:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:09:24,882 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:25,156 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2022-11-25 18:09:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:09:25,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:09:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:25,158 INFO L225 Difference]: With dead ends: 227 [2022-11-25 18:09:25,158 INFO L226 Difference]: Without dead ends: 138 [2022-11-25 18:09:25,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:25,160 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 65 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:25,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 460 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:09:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-25 18:09:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-11-25 18:09:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 89 states have internal predecessors, (100), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (28), 19 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-25 18:09:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-11-25 18:09:25,173 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 28 [2022-11-25 18:09:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:25,173 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-11-25 18:09:25,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-11-25 18:09:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:09:25,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:25,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:25,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:09:25,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1540750817, now seen corresponding path program 1 times [2022-11-25 18:09:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599758329] [2022-11-25 18:09:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599758329] [2022-11-25 18:09:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599758329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:26,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:26,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:26,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468138939] [2022-11-25 18:09:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:26,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:26,738 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:27,045 INFO L93 Difference]: Finished difference Result 230 states and 296 transitions. [2022-11-25 18:09:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:09:27,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:09:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:27,047 INFO L225 Difference]: With dead ends: 230 [2022-11-25 18:09:27,047 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 18:09:27,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:09:27,049 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 25 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:27,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 576 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:09:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 18:09:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2022-11-25 18:09:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 91 states have internal predecessors, (103), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (28), 19 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-25 18:09:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2022-11-25 18:09:27,064 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 28 [2022-11-25 18:09:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:27,066 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2022-11-25 18:09:27,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-11-25 18:09:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:09:27,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:27,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:27,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:09:27,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1798916255, now seen corresponding path program 1 times [2022-11-25 18:09:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141356070] [2022-11-25 18:09:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:27,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141356070] [2022-11-25 18:09:27,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141356070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:27,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:27,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:09:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435203374] [2022-11-25 18:09:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:09:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:09:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:09:27,732 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:09:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:27,892 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-11-25 18:09:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:09:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 18:09:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:27,894 INFO L225 Difference]: With dead ends: 218 [2022-11-25 18:09:27,894 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 18:09:27,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:09:27,895 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 14 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:27,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 378 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:09:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 18:09:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2022-11-25 18:09:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 89 states have internal predecessors, (98), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (28), 19 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-25 18:09:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-11-25 18:09:27,905 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2022-11-25 18:09:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:27,906 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-11-25 18:09:27,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:09:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-11-25 18:09:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:09:27,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:27,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:27,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:09:27,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash 568042278, now seen corresponding path program 1 times [2022-11-25 18:09:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:27,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492467708] [2022-11-25 18:09:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:27,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:28,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492467708] [2022-11-25 18:09:28,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492467708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:28,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:28,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584599334] [2022-11-25 18:09:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:28,821 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:09:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:28,979 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2022-11-25 18:09:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:09:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 18:09:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:28,980 INFO L225 Difference]: With dead ends: 136 [2022-11-25 18:09:28,981 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 18:09:28,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:09:28,982 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 31 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:28,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 832 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:09:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 18:09:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2022-11-25 18:09:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 93 states have internal predecessors, (102), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (28), 19 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-25 18:09:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-11-25 18:09:28,992 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 30 [2022-11-25 18:09:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:28,992 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-11-25 18:09:28,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:09:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-11-25 18:09:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:09:28,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:28,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:28,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:09:28,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1269106856, now seen corresponding path program 1 times [2022-11-25 18:09:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:28,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488956510] [2022-11-25 18:09:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:30,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:09:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:30,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488956510] [2022-11-25 18:09:30,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488956510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:30,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:30,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136125498] [2022-11-25 18:09:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:30,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:30,476 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:30,773 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2022-11-25 18:09:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:09:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-25 18:09:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:30,775 INFO L225 Difference]: With dead ends: 222 [2022-11-25 18:09:30,775 INFO L226 Difference]: Without dead ends: 131 [2022-11-25 18:09:30,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:30,776 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:30,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 562 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:09:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-25 18:09:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2022-11-25 18:09:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 87 states have internal predecessors, (97), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (25), 19 states have call predecessors, (25), 20 states have call successors, (25) [2022-11-25 18:09:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2022-11-25 18:09:30,784 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 30 [2022-11-25 18:09:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:30,784 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2022-11-25 18:09:30,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:09:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2022-11-25 18:09:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:09:30,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:30,786 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:09:30,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:09:30,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2009026791, now seen corresponding path program 1 times [2022-11-25 18:09:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:30,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031365843] [2022-11-25 18:09:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:09:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:31,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031365843] [2022-11-25 18:09:31,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031365843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:31,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:31,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:09:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777942822] [2022-11-25 18:09:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:31,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:09:31,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:09:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:09:31,196 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:09:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:31,240 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2022-11-25 18:09:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:09:31,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-25 18:09:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:31,243 INFO L225 Difference]: With dead ends: 150 [2022-11-25 18:09:31,243 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 18:09:31,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:09:31,244 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 32 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:31,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 316 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:09:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 18:09:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-25 18:09:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 84 states have internal predecessors, (94), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (24), 19 states have call predecessors, (24), 20 states have call successors, (24) [2022-11-25 18:09:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2022-11-25 18:09:31,253 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 37 [2022-11-25 18:09:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:31,253 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2022-11-25 18:09:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:09:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2022-11-25 18:09:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 18:09:31,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:31,255 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] [2022-11-25 18:09:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:09:31,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -992924174, now seen corresponding path program 1 times [2022-11-25 18:09:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744256305] [2022-11-25 18:09:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:09:31,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:31,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744256305] [2022-11-25 18:09:31,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744256305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:31,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:31,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318253510] [2022-11-25 18:09:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:31,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:31,975 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 2 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-25 18:09:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:32,075 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2022-11-25 18:09:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:09:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 2 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 43 [2022-11-25 18:09:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:32,079 INFO L225 Difference]: With dead ends: 127 [2022-11-25 18:09:32,079 INFO L226 Difference]: Without dead ends: 125 [2022-11-25 18:09:32,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:32,080 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 23 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:32,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 645 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:09:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-25 18:09:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-11-25 18:09:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 95 states have internal predecessors, (103), 23 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (30), 20 states have call predecessors, (30), 21 states have call successors, (30) [2022-11-25 18:09:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 156 transitions. [2022-11-25 18:09:32,094 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 156 transitions. Word has length 43 [2022-11-25 18:09:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:32,095 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 156 transitions. [2022-11-25 18:09:32,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 2 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-25 18:09:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-11-25 18:09:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:09:32,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:32,096 INFO L195 NwaCegarLoop]: trace histogram [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-25 18:09:32,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:09:32,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash 999269368, now seen corresponding path program 1 times [2022-11-25 18:09:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:32,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007146871] [2022-11-25 18:09:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:33,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:09:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007146871] [2022-11-25 18:09:34,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007146871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:34,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:34,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805723881] [2022-11-25 18:09:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:34,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:34,229 INFO L87 Difference]: Start difference. First operand 124 states and 156 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:34,887 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2022-11-25 18:09:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:09:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-25 18:09:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:34,889 INFO L225 Difference]: With dead ends: 206 [2022-11-25 18:09:34,889 INFO L226 Difference]: Without dead ends: 170 [2022-11-25 18:09:34,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:09:34,890 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:34,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 541 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:09:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-25 18:09:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2022-11-25 18:09:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 113 states have internal predecessors, (121), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (40), 22 states have call predecessors, (40), 23 states have call successors, (40) [2022-11-25 18:09:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2022-11-25 18:09:34,905 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 47 [2022-11-25 18:09:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:34,905 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2022-11-25 18:09:34,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-11-25 18:09:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:09:34,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:34,907 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:09:34,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:09:34,907 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash -280594310, now seen corresponding path program 1 times [2022-11-25 18:09:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:34,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801620410] [2022-11-25 18:09:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:09:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:36,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801620410] [2022-11-25 18:09:36,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801620410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:36,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:36,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:09:36,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017066733] [2022-11-25 18:09:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:36,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:09:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:09:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:09:36,615 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:37,168 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2022-11-25 18:09:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:09:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-25 18:09:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:37,170 INFO L225 Difference]: With dead ends: 228 [2022-11-25 18:09:37,171 INFO L226 Difference]: Without dead ends: 187 [2022-11-25 18:09:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:09:37,172 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 103 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:37,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 687 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:09:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-25 18:09:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 134. [2022-11-25 18:09:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 103 states have internal predecessors, (110), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (36), 22 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-25 18:09:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2022-11-25 18:09:37,190 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 47 [2022-11-25 18:09:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:37,191 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2022-11-25 18:09:37,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2022-11-25 18:09:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:09:37,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:37,192 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:09:37,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:09:37,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:37,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2127107650, now seen corresponding path program 1 times [2022-11-25 18:09:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:37,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355079104] [2022-11-25 18:09:37,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:38,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:09:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:38,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355079104] [2022-11-25 18:09:38,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355079104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:38,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:38,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298788335] [2022-11-25 18:09:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:38,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:38,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:38,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:38,815 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:39,334 INFO L93 Difference]: Finished difference Result 215 states and 277 transitions. [2022-11-25 18:09:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:09:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-25 18:09:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:39,337 INFO L225 Difference]: With dead ends: 215 [2022-11-25 18:09:39,337 INFO L226 Difference]: Without dead ends: 179 [2022-11-25 18:09:39,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:09:39,338 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:39,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 614 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:09:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-25 18:09:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2022-11-25 18:09:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 103 states have internal predecessors, (110), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (36), 22 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-25 18:09:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2022-11-25 18:09:39,355 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 47 [2022-11-25 18:09:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:39,355 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2022-11-25 18:09:39,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2022-11-25 18:09:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:09:39,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:39,357 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:39,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:09:39,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1812092171, now seen corresponding path program 1 times [2022-11-25 18:09:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:39,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392328227] [2022-11-25 18:09:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:09:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:09:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392328227] [2022-11-25 18:09:40,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392328227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:40,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:40,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894343187] [2022-11-25 18:09:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:40,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:40,371 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:09:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:40,638 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2022-11-25 18:09:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:09:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-11-25 18:09:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:40,640 INFO L225 Difference]: With dead ends: 140 [2022-11-25 18:09:40,640 INFO L226 Difference]: Without dead ends: 138 [2022-11-25 18:09:40,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:09:40,641 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:40,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 526 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:09:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-25 18:09:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-25 18:09:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.153061224489796) internal successors, (113), 106 states have internal predecessors, (113), 25 states have call successors, (25), 9 states have call predecessors, (25), 14 states have return successors, (36), 22 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-25 18:09:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2022-11-25 18:09:40,655 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 49 [2022-11-25 18:09:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:40,655 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2022-11-25 18:09:40,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:09:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2022-11-25 18:09:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:09:40,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:40,657 INFO L195 NwaCegarLoop]: trace histogram [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-25 18:09:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:09:40,657 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1736512573, now seen corresponding path program 1 times [2022-11-25 18:09:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:40,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849935725] [2022-11-25 18:09:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:09:41,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:41,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849935725] [2022-11-25 18:09:41,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849935725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:41,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:41,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183711264] [2022-11-25 18:09:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:41,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:41,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:41,449 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (5), 2 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-25 18:09:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:41,605 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-11-25 18:09:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:09:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (5), 2 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 49 [2022-11-25 18:09:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:41,607 INFO L225 Difference]: With dead ends: 146 [2022-11-25 18:09:41,607 INFO L226 Difference]: Without dead ends: 144 [2022-11-25 18:09:41,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:09:41,608 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 31 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:41,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 824 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:09:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-25 18:09:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2022-11-25 18:09:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 98 states have internal predecessors, (107), 25 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (30), 22 states have call predecessors, (30), 23 states have call successors, (30) [2022-11-25 18:09:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2022-11-25 18:09:41,621 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 49 [2022-11-25 18:09:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:41,622 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2022-11-25 18:09:41,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (5), 2 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-25 18:09:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2022-11-25 18:09:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:09:41,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:41,623 INFO L195 NwaCegarLoop]: trace histogram [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-25 18:09:41,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:09:41,623 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1035447995, now seen corresponding path program 1 times [2022-11-25 18:09:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:41,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975687132] [2022-11-25 18:09:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:09:43,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975687132] [2022-11-25 18:09:43,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975687132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:43,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:43,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026698803] [2022-11-25 18:09:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:43,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:43,096 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:43,677 INFO L93 Difference]: Finished difference Result 202 states and 253 transitions. [2022-11-25 18:09:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:09:43,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2022-11-25 18:09:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:43,681 INFO L225 Difference]: With dead ends: 202 [2022-11-25 18:09:43,682 INFO L226 Difference]: Without dead ends: 162 [2022-11-25 18:09:43,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:09:43,683 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:43,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 665 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:09:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-25 18:09:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2022-11-25 18:09:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 92 states have internal predecessors, (102), 25 states have call successors, (25), 9 states have call predecessors, (25), 11 states have return successors, (27), 22 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 18:09:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2022-11-25 18:09:43,703 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 49 [2022-11-25 18:09:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:43,703 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2022-11-25 18:09:43,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:09:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2022-11-25 18:09:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:09:43,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:43,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:09:43,706 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash 547482018, now seen corresponding path program 1 times [2022-11-25 18:09:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:43,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568664159] [2022-11-25 18:09:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:09:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:09:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:09:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:09:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:09:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:09:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:46,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568664159] [2022-11-25 18:09:46,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568664159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:46,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:46,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821363633] [2022-11-25 18:09:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:46,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:46,302 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:09:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:47,311 INFO L93 Difference]: Finished difference Result 240 states and 296 transitions. [2022-11-25 18:09:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:09:47,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-11-25 18:09:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:47,313 INFO L225 Difference]: With dead ends: 240 [2022-11-25 18:09:47,313 INFO L226 Difference]: Without dead ends: 144 [2022-11-25 18:09:47,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:09:47,314 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 160 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:47,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 263 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:09:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-25 18:09:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-11-25 18:09:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 108 states have internal predecessors, (118), 25 states have call successors, (25), 9 states have call predecessors, (25), 13 states have return successors, (29), 22 states have call predecessors, (29), 23 states have call successors, (29) [2022-11-25 18:09:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2022-11-25 18:09:47,332 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 56 [2022-11-25 18:09:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:47,332 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2022-11-25 18:09:47,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:09:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2022-11-25 18:09:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:09:47,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:47,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:47,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:09:47,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -732381660, now seen corresponding path program 1 times [2022-11-25 18:09:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469910628] [2022-11-25 18:09:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:09:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:09:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:09:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:09:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:09:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:09:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:50,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469910628] [2022-11-25 18:09:50,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469910628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:50,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:50,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:09:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496203872] [2022-11-25 18:09:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:50,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:09:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:50,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:09:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:09:50,083 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:09:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:50,841 INFO L93 Difference]: Finished difference Result 277 states and 336 transitions. [2022-11-25 18:09:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:09:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-11-25 18:09:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:50,843 INFO L225 Difference]: With dead ends: 277 [2022-11-25 18:09:50,843 INFO L226 Difference]: Without dead ends: 165 [2022-11-25 18:09:50,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:09:50,844 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 161 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:50,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 199 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:09:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-25 18:09:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2022-11-25 18:09:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 98 states have internal predecessors, (107), 25 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (27), 22 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 18:09:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-11-25 18:09:50,870 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 56 [2022-11-25 18:09:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:50,870 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-11-25 18:09:50,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:09:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-11-25 18:09:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:09:50,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:50,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:50,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:09:50,872 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1716072296, now seen corresponding path program 1 times [2022-11-25 18:09:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:50,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410026407] [2022-11-25 18:09:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:09:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:09:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:09:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:09:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:09:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:09:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:52,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410026407] [2022-11-25 18:09:52,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410026407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:52,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:52,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:09:52,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691349800] [2022-11-25 18:09:52,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:52,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:09:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:09:52,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:09:52,915 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:09:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:53,524 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-11-25 18:09:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:09:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-11-25 18:09:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:53,526 INFO L225 Difference]: With dead ends: 250 [2022-11-25 18:09:53,526 INFO L226 Difference]: Without dead ends: 153 [2022-11-25 18:09:53,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:09:53,528 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:53,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 233 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:09:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-25 18:09:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 130. [2022-11-25 18:09:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 98 states have internal predecessors, (107), 25 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (27), 22 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 18:09:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-11-25 18:09:53,544 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 56 [2022-11-25 18:09:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:53,545 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-11-25 18:09:53,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:09:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-11-25 18:09:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:09:53,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:53,552 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:53,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:09:53,552 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2542371, now seen corresponding path program 1 times [2022-11-25 18:09:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586597369] [2022-11-25 18:09:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:09:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:09:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 18:09:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:54,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586597369] [2022-11-25 18:09:54,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586597369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:54,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:54,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:09:54,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278243862] [2022-11-25 18:09:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:09:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:54,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:09:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:09:54,526 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:09:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:54,759 INFO L93 Difference]: Finished difference Result 166 states and 203 transitions. [2022-11-25 18:09:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:09:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2022-11-25 18:09:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:54,761 INFO L225 Difference]: With dead ends: 166 [2022-11-25 18:09:54,761 INFO L226 Difference]: Without dead ends: 142 [2022-11-25 18:09:54,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:09:54,762 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 16 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:54,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 543 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:09:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-25 18:09:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2022-11-25 18:09:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 100 states have internal predecessors, (110), 27 states have call successors, (27), 9 states have call predecessors, (27), 12 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2022-11-25 18:09:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2022-11-25 18:09:54,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 56 [2022-11-25 18:09:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:54,778 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2022-11-25 18:09:54,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:09:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2022-11-25 18:09:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 18:09:54,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:54,784 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:54,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:09:54,784 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash 606528505, now seen corresponding path program 1 times [2022-11-25 18:09:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:54,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129720377] [2022-11-25 18:09:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:09:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:09:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:09:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:09:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:09:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 18:09:55,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:55,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129720377] [2022-11-25 18:09:55,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129720377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:55,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:55,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:09:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871983035] [2022-11-25 18:09:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:55,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:09:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:09:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:09:55,142 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:09:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:55,209 INFO L93 Difference]: Finished difference Result 152 states and 186 transitions. [2022-11-25 18:09:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:09:55,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-11-25 18:09:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:55,211 INFO L225 Difference]: With dead ends: 152 [2022-11-25 18:09:55,211 INFO L226 Difference]: Without dead ends: 140 [2022-11-25 18:09:55,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:09:55,212 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:55,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:09:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-25 18:09:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2022-11-25 18:09:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.15625) internal successors, (111), 101 states have internal predecessors, (111), 27 states have call successors, (27), 9 states have call predecessors, (27), 12 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2022-11-25 18:09:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2022-11-25 18:09:55,228 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 57 [2022-11-25 18:09:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:55,229 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2022-11-25 18:09:55,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:09:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2022-11-25 18:09:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:09:55,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:55,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:55,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 18:09:55,231 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2045643665, now seen corresponding path program 1 times [2022-11-25 18:09:55,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:55,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678800037] [2022-11-25 18:09:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:09:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:09:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:09:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:09:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:09:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:09:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:09:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:09:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:09:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:09:58,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678800037] [2022-11-25 18:09:58,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678800037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:09:58,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:09:58,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-25 18:09:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283568849] [2022-11-25 18:09:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:09:58,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:09:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:09:58,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:09:58,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:09:58,457 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:10:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:00,450 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2022-11-25 18:10:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:10:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-25 18:10:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:00,452 INFO L225 Difference]: With dead ends: 159 [2022-11-25 18:10:00,453 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 18:10:00,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2022-11-25 18:10:00,454 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:00,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 823 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 18:10:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 18:10:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2022-11-25 18:10:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 104 states have internal predecessors, (114), 26 states have call successors, (26), 10 states have call predecessors, (26), 13 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2022-11-25 18:10:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2022-11-25 18:10:00,472 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 58 [2022-11-25 18:10:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:00,472 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2022-11-25 18:10:00,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:10:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2022-11-25 18:10:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:10:00,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:00,474 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:00,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 18:10:00,474 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1686681515, now seen corresponding path program 1 times [2022-11-25 18:10:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:00,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105411925] [2022-11-25 18:10:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:10:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:10:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:10:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:10:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:10:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 18:10:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:01,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105411925] [2022-11-25 18:10:01,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105411925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:01,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:01,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:10:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367741894] [2022-11-25 18:10:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:01,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:10:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:01,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:10:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:10:01,713 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:10:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:01,983 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2022-11-25 18:10:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:10:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-25 18:10:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:01,985 INFO L225 Difference]: With dead ends: 149 [2022-11-25 18:10:01,985 INFO L226 Difference]: Without dead ends: 147 [2022-11-25 18:10:01,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:10:01,986 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 14 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:01,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 712 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:10:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-25 18:10:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-11-25 18:10:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.145631067961165) internal successors, (118), 109 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 14 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2022-11-25 18:10:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 174 transitions. [2022-11-25 18:10:02,003 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 174 transitions. Word has length 58 [2022-11-25 18:10:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:02,004 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 174 transitions. [2022-11-25 18:10:02,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 18:10:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 174 transitions. [2022-11-25 18:10:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 18:10:02,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:02,005 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-25 18:10:02,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 18:10:02,006 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1219844092, now seen corresponding path program 1 times [2022-11-25 18:10:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:02,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107875814] [2022-11-25 18:10:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:10:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:10:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:10:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:10:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:10:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:10:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:10:03,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:03,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107875814] [2022-11-25 18:10:03,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107875814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:03,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:03,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:10:03,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887715285] [2022-11-25 18:10:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:03,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:10:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:10:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:10:03,087 INFO L87 Difference]: Start difference. First operand 145 states and 174 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (8), 2 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-25 18:10:03,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:03,349 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2022-11-25 18:10:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:10:03,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (8), 2 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 64 [2022-11-25 18:10:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:03,351 INFO L225 Difference]: With dead ends: 153 [2022-11-25 18:10:03,351 INFO L226 Difference]: Without dead ends: 123 [2022-11-25 18:10:03,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:10:03,352 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 13 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:03,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 717 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:10:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-25 18:10:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-25 18:10:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 94 states have internal predecessors, (103), 21 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-25 18:10:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2022-11-25 18:10:03,365 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 64 [2022-11-25 18:10:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:03,365 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2022-11-25 18:10:03,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (8), 2 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-25 18:10:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2022-11-25 18:10:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:10:03,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:03,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:03,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 18:10:03,367 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1587339025, now seen corresponding path program 1 times [2022-11-25 18:10:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:03,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849515608] [2022-11-25 18:10:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:10:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 18:10:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 18:10:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:05,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849515608] [2022-11-25 18:10:05,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849515608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:05,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071408498] [2022-11-25 18:10:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:05,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:05,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:05,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:10:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:06,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 2526 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:10:06,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:06,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:10:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:10:07,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:08,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071408498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:08,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:10:08,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-11-25 18:10:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576849048] [2022-11-25 18:10:08,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:08,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:10:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:10:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:10:08,575 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 26 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:13,368 INFO L93 Difference]: Finished difference Result 317 states and 371 transitions. [2022-11-25 18:10:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:10:13,369 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2022-11-25 18:10:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:13,370 INFO L225 Difference]: With dead ends: 317 [2022-11-25 18:10:13,371 INFO L226 Difference]: Without dead ends: 255 [2022-11-25 18:10:13,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=451, Invalid=2519, Unknown=0, NotChecked=0, Total=2970 [2022-11-25 18:10:13,373 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 280 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:13,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 563 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-25 18:10:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-25 18:10:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2022-11-25 18:10:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 151 states have (on average 1.1589403973509933) internal successors, (175), 159 states have internal predecessors, (175), 35 states have call successors, (35), 16 states have call predecessors, (35), 21 states have return successors, (38), 32 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-25 18:10:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2022-11-25 18:10:13,399 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 75 [2022-11-25 18:10:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:13,400 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2022-11-25 18:10:13,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2022-11-25 18:10:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:10:13,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:13,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:13,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 18:10:13,607 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 307475347, now seen corresponding path program 1 times [2022-11-25 18:10:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:13,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30045879] [2022-11-25 18:10:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:10:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 18:10:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:10:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:15,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30045879] [2022-11-25 18:10:15,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30045879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:15,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36123734] [2022-11-25 18:10:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:15,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:15,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:15,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:15,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:10:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:15,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 18:10:15,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:10:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:17,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36123734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:17,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:10:17,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2022-11-25 18:10:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932387263] [2022-11-25 18:10:17,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:17,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 18:10:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:17,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 18:10:17,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2022-11-25 18:10:17,330 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:20,922 INFO L93 Difference]: Finished difference Result 339 states and 401 transitions. [2022-11-25 18:10:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:10:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2022-11-25 18:10:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:20,924 INFO L225 Difference]: With dead ends: 339 [2022-11-25 18:10:20,925 INFO L226 Difference]: Without dead ends: 276 [2022-11-25 18:10:20,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 18:10:20,927 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 471 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:20,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 293 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 18:10:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-25 18:10:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 169. [2022-11-25 18:10:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 134 states have internal predecessors, (146), 23 states have call successors, (23), 13 states have call predecessors, (23), 18 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2022-11-25 18:10:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2022-11-25 18:10:20,954 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 75 [2022-11-25 18:10:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:20,954 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2022-11-25 18:10:20,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2022-11-25 18:10:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:10:20,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:20,956 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:20,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:21,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 18:10:21,167 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1539037993, now seen corresponding path program 1 times [2022-11-25 18:10:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893918481] [2022-11-25 18:10:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:10:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 18:10:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:10:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:22,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893918481] [2022-11-25 18:10:22,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893918481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:22,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868140802] [2022-11-25 18:10:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:22,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:22,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:10:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 18:10:23,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:23,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:10:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:10:24,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:25,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868140802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:25,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:10:25,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2022-11-25 18:10:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057678857] [2022-11-25 18:10:25,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:25,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 18:10:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 18:10:25,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:10:25,145 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:30,534 INFO L93 Difference]: Finished difference Result 325 states and 383 transitions. [2022-11-25 18:10:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 18:10:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2022-11-25 18:10:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:30,536 INFO L225 Difference]: With dead ends: 325 [2022-11-25 18:10:30,536 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 18:10:30,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=448, Invalid=2632, Unknown=0, NotChecked=0, Total=3080 [2022-11-25 18:10:30,538 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 442 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:30,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 323 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-25 18:10:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 18:10:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 171. [2022-11-25 18:10:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 136 states have internal predecessors, (147), 23 states have call successors, (23), 13 states have call predecessors, (23), 18 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2022-11-25 18:10:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2022-11-25 18:10:30,584 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 75 [2022-11-25 18:10:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:30,585 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2022-11-25 18:10:30,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-11-25 18:10:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:10:30,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:30,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:30,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:30,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:30,799 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1051011059, now seen corresponding path program 1 times [2022-11-25 18:10:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:30,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129668465] [2022-11-25 18:10:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:10:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 18:10:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:10:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:31,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129668465] [2022-11-25 18:10:31,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129668465] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:31,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281384087] [2022-11-25 18:10:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:31,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:31,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:31,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:10:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:31,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:10:31,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 18:10:31,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:31,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281384087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:31,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:10:31,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 18:10:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862835519] [2022-11-25 18:10:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:31,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:10:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:31,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:10:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:10:31,578 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:10:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:31,626 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-11-25 18:10:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:10:31,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2022-11-25 18:10:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:31,629 INFO L225 Difference]: With dead ends: 296 [2022-11-25 18:10:31,629 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 18:10:31,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:10:31,638 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 20 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:31,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:10:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 18:10:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2022-11-25 18:10:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 136 states have internal predecessors, (144), 23 states have call successors, (23), 13 states have call predecessors, (23), 18 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2022-11-25 18:10:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 195 transitions. [2022-11-25 18:10:31,678 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 195 transitions. Word has length 75 [2022-11-25 18:10:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:31,680 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 195 transitions. [2022-11-25 18:10:31,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:10:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 195 transitions. [2022-11-25 18:10:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:10:31,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:31,682 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:31,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:31,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 18:10:31,887 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1458776606, now seen corresponding path program 1 times [2022-11-25 18:10:31,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:31,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470969188] [2022-11-25 18:10:31,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:31,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:10:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 18:10:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:10:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:33,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470969188] [2022-11-25 18:10:33,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470969188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:33,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53626552] [2022-11-25 18:10:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:33,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:33,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:33,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:10:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:33,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 2533 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 18:10:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:33,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:10:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:10:34,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:35,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53626552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:35,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:10:35,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2022-11-25 18:10:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891142595] [2022-11-25 18:10:35,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:10:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:10:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:10:35,155 INFO L87 Difference]: Start difference. First operand 171 states and 195 transitions. Second operand has 22 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:39,256 INFO L93 Difference]: Finished difference Result 318 states and 370 transitions. [2022-11-25 18:10:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:10:39,256 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 77 [2022-11-25 18:10:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:39,260 INFO L225 Difference]: With dead ends: 318 [2022-11-25 18:10:39,260 INFO L226 Difference]: Without dead ends: 266 [2022-11-25 18:10:39,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=320, Invalid=1660, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 18:10:39,262 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 372 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:39,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 317 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-25 18:10:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-25 18:10:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 211. [2022-11-25 18:10:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.1168831168831168) internal successors, (172), 161 states have internal predecessors, (172), 34 states have call successors, (34), 18 states have call predecessors, (34), 22 states have return successors, (36), 31 states have call predecessors, (36), 30 states have call successors, (36) [2022-11-25 18:10:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2022-11-25 18:10:39,308 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 77 [2022-11-25 18:10:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:39,308 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2022-11-25 18:10:39,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 7 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-25 18:10:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2022-11-25 18:10:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:10:39,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:39,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:39,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:39,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:39,521 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:39,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash 237919648, now seen corresponding path program 1 times [2022-11-25 18:10:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:39,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900097211] [2022-11-25 18:10:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:10:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:10:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 18:10:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:41,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900097211] [2022-11-25 18:10:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900097211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:41,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:41,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:10:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077157073] [2022-11-25 18:10:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:41,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:10:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:10:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:10:41,564 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:42,588 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2022-11-25 18:10:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:10:42,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 81 [2022-11-25 18:10:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:42,590 INFO L225 Difference]: With dead ends: 271 [2022-11-25 18:10:42,590 INFO L226 Difference]: Without dead ends: 208 [2022-11-25 18:10:42,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:10:42,591 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 139 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:42,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 239 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:10:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-25 18:10:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2022-11-25 18:10:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 145 states have (on average 1.103448275862069) internal successors, (160), 152 states have internal predecessors, (160), 34 states have call successors, (34), 18 states have call predecessors, (34), 22 states have return successors, (36), 31 states have call predecessors, (36), 30 states have call successors, (36) [2022-11-25 18:10:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2022-11-25 18:10:42,640 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 81 [2022-11-25 18:10:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:42,640 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2022-11-25 18:10:42,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2022-11-25 18:10:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:10:42,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:42,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:42,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 18:10:42,642 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1041944030, now seen corresponding path program 1 times [2022-11-25 18:10:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:42,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117209580] [2022-11-25 18:10:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:10:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:10:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:10:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:43,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117209580] [2022-11-25 18:10:43,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117209580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321204205] [2022-11-25 18:10:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:43,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:43,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:10:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:44,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 18:10:44,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:44,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:44,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:44,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:44,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:44,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-25 18:10:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 18:10:44,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:44,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321204205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:44,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:10:44,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2022-11-25 18:10:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723196720] [2022-11-25 18:10:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:44,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:10:44,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:10:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:10:44,932 INFO L87 Difference]: Start difference. First operand 202 states and 230 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:46,095 INFO L93 Difference]: Finished difference Result 325 states and 368 transitions. [2022-11-25 18:10:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:10:46,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 81 [2022-11-25 18:10:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:46,098 INFO L225 Difference]: With dead ends: 325 [2022-11-25 18:10:46,098 INFO L226 Difference]: Without dead ends: 223 [2022-11-25 18:10:46,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:10:46,099 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 98 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:46,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 400 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:10:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-25 18:10:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2022-11-25 18:10:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 140 states have (on average 1.1071428571428572) internal successors, (155), 146 states have internal predecessors, (155), 34 states have call successors, (34), 18 states have call predecessors, (34), 21 states have return successors, (34), 31 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-25 18:10:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2022-11-25 18:10:46,143 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 81 [2022-11-25 18:10:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:46,144 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2022-11-25 18:10:46,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2022-11-25 18:10:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:10:46,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:46,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:46,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 18:10:46,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:46,355 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1009039968, now seen corresponding path program 1 times [2022-11-25 18:10:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:46,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772085856] [2022-11-25 18:10:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:10:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:10:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 18:10:48,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:48,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772085856] [2022-11-25 18:10:48,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772085856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:48,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:48,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:10:48,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953417583] [2022-11-25 18:10:48,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:48,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:10:48,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:10:48,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:10:48,761 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:49,794 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2022-11-25 18:10:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:10:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 81 [2022-11-25 18:10:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:49,797 INFO L225 Difference]: With dead ends: 264 [2022-11-25 18:10:49,797 INFO L226 Difference]: Without dead ends: 201 [2022-11-25 18:10:49,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:10:49,798 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 129 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:49,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 199 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:10:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-25 18:10:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2022-11-25 18:10:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 133 states have (on average 1.0902255639097744) internal successors, (145), 139 states have internal predecessors, (145), 34 states have call successors, (34), 18 states have call predecessors, (34), 21 states have return successors, (34), 31 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-25 18:10:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2022-11-25 18:10:49,854 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 81 [2022-11-25 18:10:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:49,857 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2022-11-25 18:10:49,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2022-11-25 18:10:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:10:49,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:49,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:49,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 18:10:49,859 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -837473372, now seen corresponding path program 1 times [2022-11-25 18:10:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:49,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499752497] [2022-11-25 18:10:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:10:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:10:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 18:10:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499752497] [2022-11-25 18:10:52,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499752497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:52,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:52,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:10:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18493872] [2022-11-25 18:10:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:52,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:10:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:52,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:10:52,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:10:52,075 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:52,944 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2022-11-25 18:10:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:10:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 81 [2022-11-25 18:10:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:52,946 INFO L225 Difference]: With dead ends: 231 [2022-11-25 18:10:52,946 INFO L226 Difference]: Without dead ends: 186 [2022-11-25 18:10:52,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:10:52,948 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:52,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 199 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:10:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-25 18:10:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-11-25 18:10:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 134 states have internal predecessors, (140), 34 states have call successors, (34), 18 states have call predecessors, (34), 20 states have return successors, (33), 31 states have call predecessors, (33), 30 states have call successors, (33) [2022-11-25 18:10:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2022-11-25 18:10:53,015 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 81 [2022-11-25 18:10:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:53,015 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2022-11-25 18:10:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:10:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2022-11-25 18:10:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-25 18:10:53,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:53,018 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:53,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 18:10:53,018 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1007158230, now seen corresponding path program 1 times [2022-11-25 18:10:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164639088] [2022-11-25 18:10:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:10:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:10:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:10:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 18:10:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 18:10:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:10:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:10:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164639088] [2022-11-25 18:10:54,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164639088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383993941] [2022-11-25 18:10:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:54,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:54,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:54,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:10:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 2548 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:10:55,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:55,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:10:56,345 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:10:56,346 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-25 18:10:56,349 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:10:56,350 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-25 18:10:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 18:10:56,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:56,795 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 18:10:56,796 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 25 [2022-11-25 18:10:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:10:56,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383993941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:10:56,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:10:56,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 10] total 29 [2022-11-25 18:10:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832857596] [2022-11-25 18:10:56,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:10:56,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:10:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:10:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:10:56,890 INFO L87 Difference]: Start difference. First operand 184 states and 207 transitions. Second operand has 29 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 25 states have internal predecessors, (91), 9 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2022-11-25 18:10:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:59,956 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2022-11-25 18:10:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:10:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 25 states have internal predecessors, (91), 9 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 84 [2022-11-25 18:10:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:59,958 INFO L225 Difference]: With dead ends: 230 [2022-11-25 18:10:59,958 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 18:10:59,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 176 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=407, Invalid=2563, Unknown=0, NotChecked=0, Total=2970 [2022-11-25 18:10:59,959 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 276 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:59,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 523 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 18:10:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 18:11:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2022-11-25 18:11:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 125 states have internal predecessors, (132), 30 states have call successors, (30), 16 states have call predecessors, (30), 18 states have return successors, (30), 29 states have call predecessors, (30), 27 states have call successors, (30) [2022-11-25 18:11:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2022-11-25 18:11:00,010 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 84 [2022-11-25 18:11:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:00,011 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2022-11-25 18:11:00,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 25 states have internal predecessors, (91), 9 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2022-11-25 18:11:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2022-11-25 18:11:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 18:11:00,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:00,012 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:00,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:00,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 18:11:00,227 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash -629419054, now seen corresponding path program 1 times [2022-11-25 18:11:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:00,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774441226] [2022-11-25 18:11:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:11:00,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:11:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:11:00,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:11:00,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:11:00,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:11:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 18:11:00,909 INFO L445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:00,913 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:11:00,924 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,925 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,926 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,926 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,927 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,927 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,927 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,928 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,928 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,929 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,929 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,929 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,930 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,930 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,931 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,931 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,931 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,932 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,932 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,933 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,933 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,933 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,934 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,934 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,934 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,935 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,935 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,936 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,936 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,936 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,937 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,937 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,938 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,938 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,938 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,939 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,939 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,939 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,940 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,940 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,941 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,941 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,941 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,941 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,941 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,942 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,942 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,943 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,943 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,943 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,943 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,943 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,943 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,944 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,944 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,944 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,945 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,945 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,945 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,946 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,946 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,946 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,946 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,946 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,947 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,947 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,947 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,947 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,947 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,948 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,948 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,948 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,948 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,948 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,948 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,949 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,949 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,949 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,949 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,949 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,950 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,950 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,950 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,950 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,950 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,950 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,951 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,951 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,951 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,951 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,951 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,952 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,952 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,952 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,952 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,952 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,953 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,953 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,954 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,954 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,954 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,955 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,955 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,956 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,956 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,956 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,957 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,957 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,958 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,958 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,958 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,964 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,965 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,965 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,965 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,965 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,966 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,966 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,966 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,966 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,966 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,967 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,967 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,967 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,967 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,967 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,968 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,968 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,968 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,968 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,968 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,968 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,969 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,969 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,969 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,969 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,970 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,970 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,970 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,970 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,970 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,970 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,971 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,971 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,976 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,976 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,977 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,977 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,978 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,978 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,978 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,979 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,979 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,980 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,980 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,981 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,981 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,981 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,981 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,981 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,982 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,982 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,982 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,982 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,982 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,983 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,983 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,985 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,985 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,985 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,986 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,986 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,986 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,986 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,987 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,987 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,988 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,988 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,988 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,988 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,988 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,989 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,989 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,989 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,989 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,990 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,990 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,990 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,990 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,990 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,991 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,991 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,992 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,992 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,993 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,993 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,996 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,996 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:00,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:00,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:00,999 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:00,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:00,999 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:00,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,002 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,002 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,004 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,004 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,004 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,005 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,005 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,005 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,006 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,011 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,011 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,011 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,011 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,011 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,011 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,012 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,012 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,012 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,012 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,012 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,013 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,014 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,014 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,014 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,014 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,014 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,014 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,015 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,015 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,015 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,015 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,016 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,016 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,016 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,017 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,017 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,017 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,018 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,018 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,018 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,018 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,019 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,019 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,019 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,019 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,019 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,019 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,020 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,020 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,020 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,020 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,020 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,020 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,021 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,021 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,021 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,021 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,022 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,022 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,022 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,024 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,024 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,024 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,025 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,025 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,025 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,026 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,026 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,026 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,027 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,027 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,027 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,028 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,028 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,028 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,029 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,029 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,029 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,030 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,030 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,030 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,031 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,031 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,031 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,032 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,032 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,032 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,033 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,033 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,033 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,033 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,033 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,033 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,034 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,034 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,034 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,035 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,035 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,035 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,036 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,036 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,036 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,037 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,037 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,037 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,037 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,037 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,037 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,038 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,039 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,039 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,039 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,039 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,039 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,039 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,040 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,040 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,040 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,042 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,042 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,042 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,043 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,043 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,043 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,044 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,045 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,045 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,045 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,045 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,046 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,046 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,046 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,046 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,047 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,047 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,047 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,047 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,048 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,048 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,048 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,050 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,050 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,050 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,051 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,051 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,051 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,052 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,053 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,053 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,053 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,053 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,054 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,054 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,054 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,054 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,055 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,055 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,055 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,055 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,056 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,057 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,057 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,057 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,057 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,058 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,058 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,058 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,058 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,059 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,059 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,059 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,059 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,059 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,059 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,060 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,061 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,061 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,061 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,062 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,062 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,062 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,062 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,063 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2022-11-25 18:11:01,064 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-11-25 18:11:01,065 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2022-11-25 18:11:01,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:11:01 BoogieIcfgContainer [2022-11-25 18:11:01,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:11:01,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:11:01,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:11:01,136 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:11:01,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:09:15" (3/4) ... [2022-11-25 18:11:01,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 18:11:01,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:11:01,141 INFO L158 Benchmark]: Toolchain (without parser) took 111339.77ms. Allocated memory was 203.4MB in the beginning and 1.2GB in the end (delta: 975.2MB). Free memory was 160.6MB in the beginning and 999.8MB in the end (delta: -839.1MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2022-11-25 18:11:01,141 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:11:01,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3399.84ms. Allocated memory is still 203.4MB. Free memory was 160.6MB in the beginning and 143.9MB in the end (delta: 16.7MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. [2022-11-25 18:11:01,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.98ms. Allocated memory is still 203.4MB. Free memory was 143.9MB in the beginning and 132.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 18:11:01,142 INFO L158 Benchmark]: Boogie Preprocessor took 65.26ms. Allocated memory is still 203.4MB. Free memory was 132.4MB in the beginning and 125.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:11:01,142 INFO L158 Benchmark]: RCFGBuilder took 1796.79ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 125.1MB in the beginning and 206.4MB in the end (delta: -81.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-11-25 18:11:01,143 INFO L158 Benchmark]: TraceAbstraction took 105891.32ms. Allocated memory was 270.5MB in the beginning and 1.2GB in the end (delta: 908.1MB). Free memory was 205.5MB in the beginning and 999.8MB in the end (delta: -794.2MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2022-11-25 18:11:01,143 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 1.2GB. Free memory is still 999.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:11:01,144 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.19ms. Allocated memory is still 151.0MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3399.84ms. Allocated memory is still 203.4MB. Free memory was 160.6MB in the beginning and 143.9MB in the end (delta: 16.7MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.98ms. Allocated memory is still 203.4MB. Free memory was 143.9MB in the beginning and 132.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.26ms. Allocated memory is still 203.4MB. Free memory was 132.4MB in the beginning and 125.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1796.79ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 125.1MB in the beginning and 206.4MB in the end (delta: -81.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 105891.32ms. Allocated memory was 270.5MB in the beginning and 1.2GB in the end (delta: 908.1MB). Free memory was 205.5MB in the beginning and 999.8MB in the end (delta: -794.2MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 1.2GB. Free memory is still 999.8MB. There was no memory consumed. 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 ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#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_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_c_str_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 8772, overapproximation of strlen at line 8191. Possible FailurePath: [L6866-L6871] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7311] static __thread int tl_last_error = 0; [L7648-L7660] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L8771-L8919] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L8922-L8925] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L8927-L8936] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L8938-L8941] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L8943-L8947] static _Bool s_common_library_initialized = 0 ; VAL [errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8985] CALL aws_byte_buf_from_c_str_harness() [L8961] CALL, EXPR nondet_bool() VAL [errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L261] return __VERIFIER_nondet_bool(); [L8961] RET, EXPR nondet_bool() VAL [errors={196:0}, nondet_bool()=0, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8961-L8963] EXPR nondet_bool() ? ((void *)0) : ensure_c_str_is_allocated(10) [L8963] CALL, EXPR ensure_c_str_is_allocated(10) [L6819] CALL, EXPR nondet_uint64_t() VAL [errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6819] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=10, errors={196:0}, max_size=10, nondet_uint64_t()=-18446744073709551615, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L6819] size_t cap = nondet_uint64_t(); [L6820] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L6820] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=10, cap=1, errors={196:0}, max_size=10, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L6821] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L6883-L6885] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L6883-L6885] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, size=1, tl_last_error=0] [L6886] return malloc(size); [L6821] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=10, bounded_malloc(cap)={-2:0}, cap=1, errors={196:0}, max_size=10, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L6821] const char *str = bounded_malloc(cap); [L6825] EXPR str[cap - 1] VAL [\old(max_size)=10, cap=1, errors={196:0}, max_size=10, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, str={-2:0}, str[cap - 1]=0, tl_last_error=0] [L6825] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L6825] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=10, cap=1, errors={196:0}, max_size=10, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, str={-2:0}, str[cap - 1]=0, tl_last_error=0] [L6826] return str; VAL [\old(max_size)=10, \result={-2:0}, cap=1, errors={196:0}, max_size=10, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, str={-2:0}, tl_last_error=0] [L8963] RET, EXPR ensure_c_str_is_allocated(10) [L8961-L8963] EXPR nondet_bool() ? ((void *)0) : ensure_c_str_is_allocated(10) VAL [ensure_c_str_is_allocated(10)={-2:0}, errors={196:0}, nondet_bool()=0, nondet_bool() ? ((void *)0) : ensure_c_str_is_allocated(10)={-2:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8961-L8963] const char *c_str = nondet_bool() ? ((void *)0) : ensure_c_str_is_allocated(10); [L8966] struct aws_byte_buf buf = aws_byte_buf_from_c_str(c_str); [L8966] CALL, EXPR aws_byte_buf_from_c_str(c_str) [L8190] struct aws_byte_buf buf; [L8191] buf.len = (!c_str) ? 0 : strlen(c_str) [L8192] EXPR buf.len [L8192] buf.capacity = buf.len [L8193] EXPR buf.capacity [L8193-L8195] buf.buffer = (buf.capacity == 0) ? ((void *)0) : (uint8_t *)c_str [L8196-L8197] buf.allocator = ((void *)0) VAL [buf={257:0}, c_str={-2:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8199] CALL, EXPR aws_byte_buf_is_valid(&buf) VAL [buf={257:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7377] EXPR buf->capacity [L7377] EXPR buf->capacity == 0 && buf->len == 0 [L7377] EXPR buf->len [L7377] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={257:0}, buf={257:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7378] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) [L7377] EXPR buf->buffer [L7377-L7378] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={257:0}, buf={257:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={0:0}, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={257:0}, buf={257:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={0:0}, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={257:0}, buf={257:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={0:0}, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L8199] RET, EXPR aws_byte_buf_is_valid(&buf) VAL [aws_byte_buf_is_valid(&buf)=1, buf={257:0}, c_str={-2:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8199] CALL __VERIFIER_assert((aws_byte_buf_is_valid(&buf))) VAL [\old(cond)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8199] RET __VERIFIER_assert((aws_byte_buf_is_valid(&buf))) VAL [aws_byte_buf_is_valid(&buf)=1, buf={257:0}, c_str={-2:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8200] return buf; [L8200] return buf; VAL [#res!capacity=0, #res!len=0, aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, c_str={-2:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8966] RET, EXPR aws_byte_buf_from_c_str(c_str) [L8966] struct aws_byte_buf buf = aws_byte_buf_from_c_str(c_str); [L8969] CALL, EXPR aws_byte_buf_is_valid(&buf) VAL [buf={258:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7377] EXPR buf->capacity [L7377] EXPR buf->capacity == 0 && buf->len == 0 [L7377] EXPR buf->len [L7377] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={258:0}, buf={258:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7378] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) [L7377] EXPR buf->buffer [L7377-L7378] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={258:0}, buf={258:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={0:0}, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={258:0}, buf={258:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={0:0}, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={258:0}, buf={258:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={0:0}, buf->capacity=0, buf->capacity == 0 && buf->len == 0=1, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=1, buf->len=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L7377-L7380] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L8969] RET, EXPR aws_byte_buf_is_valid(&buf) VAL [aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, aws_byte_buf_is_valid(&buf)=1, buf={258:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8969] CALL __VERIFIER_assert(aws_byte_buf_is_valid(&buf)) VAL [\old(cond)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8969] RET __VERIFIER_assert(aws_byte_buf_is_valid(&buf)) VAL [aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, aws_byte_buf_is_valid(&buf)=1, buf={258:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8970] EXPR buf.allocator VAL [aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, buf={258:0}, buf.allocator={0:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8970-L8972] CALL __VERIFIER_assert(buf.allocator == ((void *)0) ) VAL [\old(cond)=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8970-L8972] RET __VERIFIER_assert(buf.allocator == ((void *)0) ) VAL [aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, buf={258:0}, buf.allocator={0:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8973] buf.buffer VAL [aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, buf={258:0}, buf.buffer={0:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L8973] COND FALSE !(buf.buffer) [L8978] COND TRUE \read(*c_str) VAL [aws_byte_buf_from_c_str_#res#1.allocator={0:0}, aws_byte_buf_from_c_str_#res#1.buffer={0:0}, buf={258:0}, c_str={-2:0}, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L8979] CALL __VERIFIER_assert(strlen(c_str) == 0) VAL [\old(cond)=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, s_tolower_table={195:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, errors={196:0}, s_can_fail_allocator_static={194:0}, s_common_library_initialized=0, s_common_log_subject_infos={197:0}, s_common_log_subject_list=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, s_tolower_table={195:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 105.6s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3688 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3595 mSDsluCounter, 16735 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13771 mSDsCounter, 904 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16492 IncrementalHoareTripleChecker+Invalid, 17396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 904 mSolverCounterUnsat, 2964 mSDtfsCounter, 16492 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1664 GetRequests, 1074 SyntacticMatches, 24 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=30, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 779 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 8.6s SatisfiabilityAnalysisTime, 55.8s InterpolantComputationTime, 2483 NumberOfCodeBlocks, 2483 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2439 ConstructedInterpolants, 132 QuantifiedInterpolants, 16852 SizeOfPredicates, 82 NumberOfNonLiveVariables, 17699 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 696/800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 18:11:01,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 926c219674f55200b40d9809e5b1fdaded5b761814321598aab4b2039c1325ea --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:11:03,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:11:03,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:11:03,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:11:03,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:11:03,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:11:03,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:11:03,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:11:03,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:11:03,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:11:03,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:11:03,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:11:03,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:11:03,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:11:03,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:11:03,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:11:03,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:11:03,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:11:03,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:11:03,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:11:03,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:11:03,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:11:03,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:11:03,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:11:03,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:11:03,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:11:03,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:11:03,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:11:03,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:11:03,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:11:03,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:11:03,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:11:03,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:11:03,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:11:03,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:11:03,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:11:03,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:11:03,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:11:03,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:11:03,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:11:03,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:11:03,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-25 18:11:03,787 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:11:03,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:11:03,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:11:03,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:11:03,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:11:03,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:11:03,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:11:03,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:11:03,792 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:11:03,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:11:03,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:11:03,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:11:03,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:11:03,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:11:03,795 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:11:03,795 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:11:03,795 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:11:03,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:11:03,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:11:03,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:11:03,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:11:03,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:11:03,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:11:03,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:11:03,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:11:03,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:11:03,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:11:03,799 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:11:03,799 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:11:03,799 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:11:03,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:11:03,800 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:11:03,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:11:03,800 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:11:03,801 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 926c219674f55200b40d9809e5b1fdaded5b761814321598aab4b2039c1325ea [2022-11-25 18:11:04,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:11:04,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:11:04,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:11:04,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:11:04,332 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:11:04,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-11-25 18:11:07,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:11:08,199 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:11:08,199 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-11-25 18:11:08,249 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data/10112f080/af23736e27b945fdb6760bee02b4b5eb/FLAG2b37cf8b5 [2022-11-25 18:11:08,275 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/data/10112f080/af23736e27b945fdb6760bee02b4b5eb [2022-11-25 18:11:08,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:11:08,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:11:08,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:11:08,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:11:08,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:11:08,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:11:08" (1/1) ... [2022-11-25 18:11:08,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34509ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:08, skipping insertion in model container [2022-11-25 18:11:08,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:11:08" (1/1) ... [2022-11-25 18:11:08,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:11:08,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:11:08,762 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-11-25 18:11:08,771 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-11-25 18:11:09,793 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,793 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,794 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,795 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,797 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,813 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,814 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,817 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,818 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:09,909 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:09,910 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:09,911 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:09,918 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:11:09,921 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:11:09,924 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:11:10,262 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:11:10,263 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:11:10,265 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:11:10,267 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:11:10,268 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:11:10,270 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:11:10,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:11:10,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:11:10,273 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:11:10,274 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:11:10,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:11:10,501 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:11:10,597 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:11:10,618 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:11:10,681 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:11:10,695 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,700 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,774 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:11:10,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:11:10,901 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 18:11:10,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:11:10,943 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-11-25 18:11:10,944 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-11-25 18:11:10,974 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,974 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,975 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,975 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,976 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,981 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,982 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,983 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,983 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:10,990 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:10,990 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:10,991 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:10,994 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:11:10,995 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:11:10,995 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:11:11,034 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:11:11,035 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:11:11,036 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:11:11,036 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:11:11,037 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:11:11,038 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:11:11,038 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:11:11,039 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:11:11,039 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:11:11,040 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:11:11,040 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:11:11,059 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:11:11,079 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:11:11,085 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:11:11,101 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:11:11,107 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,111 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,153 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:11:11,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:11:11,199 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:11:11,239 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-11-25 18:11:11,240 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_9785e60b-bb61-4186-83b5-56437106ffd8/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-11-25 18:11:11,285 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,286 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,286 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,287 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,287 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,292 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,294 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,295 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,303 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:11,304 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:11,305 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:11:11,308 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:11:11,309 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:11:11,311 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:11:11,334 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:11:11,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:11:11,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:11:11,336 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:11:11,337 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:11:11,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:11:11,340 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:11:11,340 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:11:11,341 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:11:11,342 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:11:11,342 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:11:11,362 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:11:11,391 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 18:11:11,397 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:11:11,420 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:11:11,428 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,429 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:11:11,476 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:11:11,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:11:11,858 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:11:11,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11 WrapperNode [2022-11-25 18:11:11,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:11:11,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:11:11,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:11:11,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:11:11,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:11,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,118 INFO L138 Inliner]: procedures = 710, calls = 2621, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 824 [2022-11-25 18:11:12,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:11:12,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:11:12,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:11:12,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:11:12,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,250 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:11:12,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:11:12,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:11:12,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:11:12,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (1/1) ... [2022-11-25 18:11:12,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:11:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:12,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:11:12,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:11:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-25 18:11:12,384 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-25 18:11:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:11:12,384 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 18:11:12,384 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 18:11:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:11:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 18:11:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-25 18:11:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:11:12,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:11:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:11:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:11:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:11:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:11:12,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:11:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 18:11:12,391 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 18:11:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 18:11:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-25 18:11:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:11:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:11:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:11:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:11:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-25 18:11:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:11:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:11:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:11:12,786 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:11:12,789 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:11:16,840 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:11:16,848 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:11:16,848 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:11:16,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:11:16 BoogieIcfgContainer [2022-11-25 18:11:16,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:11:16,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:11:16,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:11:16,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:11:16,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:11:08" (1/3) ... [2022-11-25 18:11:16,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62418f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:11:16, skipping insertion in model container [2022-11-25 18:11:16,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:11:11" (2/3) ... [2022-11-25 18:11:16,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62418f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:11:16, skipping insertion in model container [2022-11-25 18:11:16,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:11:16" (3/3) ... [2022-11-25 18:11:16,862 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_c_str_harness.i [2022-11-25 18:11:16,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:11:16,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:11:16,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:11:16,960 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;@56e0228f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:11:16,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:11:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 60 states have internal predecessors, (73), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:11:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:11:16,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:16,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:16,980 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1479345354, now seen corresponding path program 1 times [2022-11-25 18:11:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:11:17,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346958171] [2022-11-25 18:11:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:17,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:17,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:11:17,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:11:17,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 18:11:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:18,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:11:18,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:11:18,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:18,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:11:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346958171] [2022-11-25 18:11:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346958171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:18,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:18,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:11:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700377599] [2022-11-25 18:11:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:18,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:11:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:11:18,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:11:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:11:18,292 INFO L87 Difference]: Start difference. First operand has 87 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 60 states have internal predecessors, (73), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:11:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:18,427 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2022-11-25 18:11:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:11:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-25 18:11:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:18,441 INFO L225 Difference]: With dead ends: 167 [2022-11-25 18:11:18,441 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 18:11:18,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:11:18,448 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 18 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:18,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 312 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:11:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 18:11:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-25 18:11:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-11-25 18:11:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-11-25 18:11:18,501 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 18 [2022-11-25 18:11:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:18,502 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-11-25 18:11:18,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:11:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-11-25 18:11:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:11:18,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:18,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:18,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 18:11:18,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:18,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash -409891947, now seen corresponding path program 1 times [2022-11-25 18:11:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:11:18,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677223712] [2022-11-25 18:11:18,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:11:18,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:11:18,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 18:11:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:19,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:11:19,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:11:19,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:19,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:11:19,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677223712] [2022-11-25 18:11:19,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677223712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:19,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:19,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:11:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408187572] [2022-11-25 18:11:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:19,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:11:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:11:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:11:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:11:19,970 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:11:21,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:11:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:22,202 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-11-25 18:11:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:11:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-25 18:11:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:22,204 INFO L225 Difference]: With dead ends: 94 [2022-11-25 18:11:22,204 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 18:11:22,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:11:22,205 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:22,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 653 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 18:11:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 18:11:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-11-25 18:11:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 21 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-11-25 18:11:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2022-11-25 18:11:22,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 24 [2022-11-25 18:11:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:22,219 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2022-11-25 18:11:22,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:11:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-11-25 18:11:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:11:22,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:22,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:22,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:22,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:22,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 113995101, now seen corresponding path program 1 times [2022-11-25 18:11:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:11:22,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255374122] [2022-11-25 18:11:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:22,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:22,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:11:22,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:11:22,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 18:11:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:11:23,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:11:23,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:23,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:11:23,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255374122] [2022-11-25 18:11:23,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255374122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:23,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:23,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:11:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756767948] [2022-11-25 18:11:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:23,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:11:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:11:23,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:11:23,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:11:23,994 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:11:26,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:11:28,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:11:30,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:11:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:31,795 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2022-11-25 18:11:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:11:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 18:11:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:31,799 INFO L225 Difference]: With dead ends: 173 [2022-11-25 18:11:31,799 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 18:11:31,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:11:31,803 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:31,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 7.6s Time] [2022-11-25 18:11:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 18:11:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-11-25 18:11:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 69 states have internal predecessors, (78), 21 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-11-25 18:11:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2022-11-25 18:11:31,823 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2022-11-25 18:11:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:31,823 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2022-11-25 18:11:31,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:11:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-11-25 18:11:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:11:31,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:31,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:31,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:32,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:32,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash 372160539, now seen corresponding path program 1 times [2022-11-25 18:11:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:11:32,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735163818] [2022-11-25 18:11:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:32,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:11:32,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:11:32,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 18:11:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 18:11:38,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:38,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:11:38,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:11:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:11:39,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:39,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:11:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735163818] [2022-11-25 18:11:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735163818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:39,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:39,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:11:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364153507] [2022-11-25 18:11:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:39,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:11:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:11:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:11:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:11:39,570 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:11:41,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:11:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:45,591 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2022-11-25 18:11:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:11:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:11:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:45,599 INFO L225 Difference]: With dead ends: 258 [2022-11-25 18:11:45,599 INFO L226 Difference]: Without dead ends: 189 [2022-11-25 18:11:45,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:11:45,601 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 135 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:45,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 452 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 18:11:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-25 18:11:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2022-11-25 18:11:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 129 states have (on average 1.2325581395348837) internal successors, (159), 137 states have internal predecessors, (159), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2022-11-25 18:11:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 233 transitions. [2022-11-25 18:11:45,627 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 233 transitions. Word has length 28 [2022-11-25 18:11:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:45,628 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 233 transitions. [2022-11-25 18:11:45,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:11:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 233 transitions. [2022-11-25 18:11:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:11:45,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:45,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:45,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:45,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash -907703139, now seen corresponding path program 1 times [2022-11-25 18:11:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:11:45,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720048497] [2022-11-25 18:11:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:11:45,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:11:45,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:11:45,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 18:11:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:52,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:11:52,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:53,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:53,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:53,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 177 [2022-11-25 18:11:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:11:56,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:56,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:11:56,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720048497] [2022-11-25 18:11:56,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720048497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:56,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:56,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:11:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143374415] [2022-11-25 18:11:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:56,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:11:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:11:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:11:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:11:56,247 INFO L87 Difference]: Start difference. First operand 182 states and 233 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:11:58,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:12:03,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:06,003 INFO L93 Difference]: Finished difference Result 292 states and 371 transitions. [2022-11-25 18:12:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:12:06,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:12:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:06,008 INFO L225 Difference]: With dead ends: 292 [2022-11-25 18:12:06,008 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 18:12:06,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:12:06,010 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 116 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:06,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 587 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2022-11-25 18:12:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 18:12:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2022-11-25 18:12:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 128 states have (on average 1.234375) internal successors, (158), 136 states have internal predecessors, (158), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2022-11-25 18:12:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 232 transitions. [2022-11-25 18:12:06,040 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 232 transitions. Word has length 28 [2022-11-25 18:12:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:06,041 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 232 transitions. [2022-11-25 18:12:06,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:12:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 232 transitions. [2022-11-25 18:12:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:12:06,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:06,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:06,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:12:06,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:12:06,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:12:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1540750817, now seen corresponding path program 1 times [2022-11-25 18:12:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:12:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918155750] [2022-11-25 18:12:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:12:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:12:06,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:12:06,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 18:12:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:13,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 18:12:13,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:12:13,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:12:13,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:12:13,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 351 [2022-11-25 18:12:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:12:18,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:12:18,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:12:18,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918155750] [2022-11-25 18:12:18,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918155750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:18,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:18,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:12:18,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419450561] [2022-11-25 18:12:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:18,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:12:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:12:18,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:12:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:12:18,534 INFO L87 Difference]: Start difference. First operand 181 states and 232 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:12:21,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:12:39,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:41,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:12:43,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:45,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:47,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:49,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:12:51,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:53,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:12:56,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:13:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:00,157 INFO L93 Difference]: Finished difference Result 300 states and 381 transitions. [2022-11-25 18:13:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:13:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 18:13:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:00,159 INFO L225 Difference]: With dead ends: 300 [2022-11-25 18:13:00,160 INFO L226 Difference]: Without dead ends: 220 [2022-11-25 18:13:00,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:13:00,161 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 127 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:00,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 846 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 454 Invalid, 10 Unknown, 0 Unchecked, 29.5s Time] [2022-11-25 18:13:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-25 18:13:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 183. [2022-11-25 18:13:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 138 states have internal predecessors, (161), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2022-11-25 18:13:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 235 transitions. [2022-11-25 18:13:00,195 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 235 transitions. Word has length 28 [2022-11-25 18:13:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:00,196 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 235 transitions. [2022-11-25 18:13:00,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:13:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 235 transitions. [2022-11-25 18:13:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:13:00,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:00,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:00,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:00,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:00,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1798916255, now seen corresponding path program 1 times [2022-11-25 18:13:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:00,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090528355] [2022-11-25 18:13:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:00,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:13:00,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 18:13:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:01,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:13:01,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:01,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:01,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:01,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090528355] [2022-11-25 18:13:01,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090528355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:01,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:01,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:13:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101739098] [2022-11-25 18:13:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:01,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:13:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:13:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:13:01,729 INFO L87 Difference]: Start difference. First operand 183 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:13:04,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:13:06,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:13:08,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:13:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:09,392 INFO L93 Difference]: Finished difference Result 356 states and 462 transitions. [2022-11-25 18:13:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:13:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 18:13:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:09,396 INFO L225 Difference]: With dead ends: 356 [2022-11-25 18:13:09,397 INFO L226 Difference]: Without dead ends: 207 [2022-11-25 18:13:09,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:13:09,398 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 30 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:09,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 362 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-11-25 18:13:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-25 18:13:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2022-11-25 18:13:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 128 states have (on average 1.2109375) internal successors, (155), 136 states have internal predecessors, (155), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2022-11-25 18:13:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 229 transitions. [2022-11-25 18:13:09,427 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 229 transitions. Word has length 28 [2022-11-25 18:13:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:09,427 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 229 transitions. [2022-11-25 18:13:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:13:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 229 transitions. [2022-11-25 18:13:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:13:09,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:09,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:09,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:09,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:09,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash 568042278, now seen corresponding path program 1 times [2022-11-25 18:13:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:09,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192388295] [2022-11-25 18:13:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:09,656 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:13:09,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 18:13:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:10,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 18:13:10,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:10,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:10,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:10,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192388295] [2022-11-25 18:13:10,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192388295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:10,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:10,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:13:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066824817] [2022-11-25 18:13:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:10,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:13:10,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:13:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:13:10,624 INFO L87 Difference]: Start difference. First operand 181 states and 229 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:13:12,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:13:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:13,079 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2022-11-25 18:13:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:13:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 18:13:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:13,082 INFO L225 Difference]: With dead ends: 215 [2022-11-25 18:13:13,082 INFO L226 Difference]: Without dead ends: 213 [2022-11-25 18:13:13,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:13:13,083 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 31 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:13,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 832 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-25 18:13:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-25 18:13:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 185. [2022-11-25 18:13:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 132 states have (on average 1.2045454545454546) internal successors, (159), 140 states have internal predecessors, (159), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2022-11-25 18:13:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2022-11-25 18:13:13,111 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 30 [2022-11-25 18:13:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:13,112 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2022-11-25 18:13:13,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:13:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2022-11-25 18:13:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:13:13,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:13,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:13,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:13,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:13,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:13,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1269106856, now seen corresponding path program 1 times [2022-11-25 18:13:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:13,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738816768] [2022-11-25 18:13:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:13,333 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:13:13,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 18:13:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:20,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 18:13:20,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:21,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:21,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 409 [2022-11-25 18:13:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:24,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:24,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:24,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738816768] [2022-11-25 18:13:24,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738816768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:24,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:24,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:13:24,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321706681] [2022-11-25 18:13:24,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:24,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:13:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:13:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:13:24,207 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:13:26,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:13:30,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:13:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:32,563 INFO L93 Difference]: Finished difference Result 286 states and 356 transitions. [2022-11-25 18:13:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:13:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-25 18:13:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:32,565 INFO L225 Difference]: With dead ends: 286 [2022-11-25 18:13:32,566 INFO L226 Difference]: Without dead ends: 199 [2022-11-25 18:13:32,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:13:32,567 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 108 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:32,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 464 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-11-25 18:13:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-25 18:13:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 170. [2022-11-25 18:13:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 126 states have internal predecessors, (143), 35 states have call successors, (35), 12 states have call predecessors, (35), 15 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) [2022-11-25 18:13:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2022-11-25 18:13:32,595 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 30 [2022-11-25 18:13:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:32,596 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2022-11-25 18:13:32,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:13:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2022-11-25 18:13:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:13:32,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:32,598 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:13:32,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-25 18:13:32,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:32,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2009026791, now seen corresponding path program 1 times [2022-11-25 18:13:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872204638] [2022-11-25 18:13:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:32,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:32,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:32,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:13:32,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 18:13:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:33,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:13:33,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:13:33,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:33,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:33,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872204638] [2022-11-25 18:13:33,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872204638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:33,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:33,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:13:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113945739] [2022-11-25 18:13:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:13:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:13:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:13:33,866 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:13:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:34,092 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2022-11-25 18:13:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:13:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-25 18:13:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:34,096 INFO L225 Difference]: With dead ends: 243 [2022-11-25 18:13:34,096 INFO L226 Difference]: Without dead ends: 167 [2022-11-25 18:13:34,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:13:34,098 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 32 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:34,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 316 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:13:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-25 18:13:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-25 18:13:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 117 states have (on average 1.188034188034188) internal successors, (139), 123 states have internal predecessors, (139), 35 states have call successors, (35), 12 states have call predecessors, (35), 14 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2022-11-25 18:13:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 208 transitions. [2022-11-25 18:13:34,124 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 208 transitions. Word has length 37 [2022-11-25 18:13:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:34,124 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 208 transitions. [2022-11-25 18:13:34,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:13:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-11-25 18:13:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 18:13:34,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:34,126 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] [2022-11-25 18:13:34,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:34,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:34,335 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash -992924174, now seen corresponding path program 1 times [2022-11-25 18:13:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:34,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231482501] [2022-11-25 18:13:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:34,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:34,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:34,338 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:13:34,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 18:13:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:35,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 18:13:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:38,273 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 18:13:38,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 42 [2022-11-25 18:13:38,283 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 18:13:38,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 26 [2022-11-25 18:13:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:38,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:41,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231482501] [2022-11-25 18:13:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231482501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [735762028] [2022-11-25 18:13:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:13:41,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:13:41,865 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:13:41,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-25 18:13:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:47,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:13:47,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:13:48,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:48,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [735762028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:48,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:13:48,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 22 [2022-11-25 18:13:48,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250518694] [2022-11-25 18:13:48,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:48,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:13:48,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:13:48,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:13:48,284 INFO L87 Difference]: Start difference. First operand 167 states and 208 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 2 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-25 18:13:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:48,598 INFO L93 Difference]: Finished difference Result 189 states and 232 transitions. [2022-11-25 18:13:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:13:48,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 2 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 43 [2022-11-25 18:13:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:48,600 INFO L225 Difference]: With dead ends: 189 [2022-11-25 18:13:48,601 INFO L226 Difference]: Without dead ends: 187 [2022-11-25 18:13:48,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 18:13:48,602 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 23 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:48,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 645 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:13:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-25 18:13:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-11-25 18:13:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 137 states have internal predecessors, (151), 37 states have call successors, (37), 14 states have call predecessors, (37), 18 states have return successors, (39), 33 states have call predecessors, (39), 33 states have call successors, (39) [2022-11-25 18:13:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 227 transitions. [2022-11-25 18:13:48,629 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 227 transitions. Word has length 43 [2022-11-25 18:13:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:48,630 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 227 transitions. [2022-11-25 18:13:48,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 2 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-25 18:13:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 227 transitions. [2022-11-25 18:13:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:13:48,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:48,631 INFO L195 NwaCegarLoop]: trace histogram [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-25 18:13:48,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:48,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:49,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:49,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 999269368, now seen corresponding path program 1 times [2022-11-25 18:13:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:49,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733086633] [2022-11-25 18:13:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:49,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:13:49,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:49,049 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:13:49,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 18:13:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:50,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 18:13:50,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:52,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:54,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:54,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733086633] [2022-11-25 18:13:54,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733086633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:54,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1300225389] [2022-11-25 18:13:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:13:54,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:13:54,877 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:13:54,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-25 18:14:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:00,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:14:00,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:00,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:14:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:02,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:02,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1300225389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:14:02,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:14:02,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2022-11-25 18:14:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373804134] [2022-11-25 18:14:02,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:14:02,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:14:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:14:02,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:14:02,927 INFO L87 Difference]: Start difference. First operand 185 states and 227 transitions. Second operand has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 18:14:05,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:14:07,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:14:09,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:14:11,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:14:13,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:14:28,027 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 31 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:35,479 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 40 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:41,925 INFO L93 Difference]: Finished difference Result 442 states and 535 transitions. [2022-11-25 18:14:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:14:41,928 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2022-11-25 18:14:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:41,930 INFO L225 Difference]: With dead ends: 442 [2022-11-25 18:14:41,930 INFO L226 Difference]: Without dead ends: 308 [2022-11-25 18:14:41,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2022-11-25 18:14:41,936 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 144 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 34 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:41,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 800 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 561 Invalid, 5 Unknown, 0 Unchecked, 15.5s Time] [2022-11-25 18:14:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-25 18:14:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 200. [2022-11-25 18:14:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.1608391608391608) internal successors, (166), 151 states have internal predecessors, (166), 37 states have call successors, (37), 15 states have call predecessors, (37), 19 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2022-11-25 18:14:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2022-11-25 18:14:41,980 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 47 [2022-11-25 18:14:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:41,981 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2022-11-25 18:14:41,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 18:14:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2022-11-25 18:14:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:14:41,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:41,983 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:14:41,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-25 18:14:42,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:14:42,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:14:42,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:14:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash -280594310, now seen corresponding path program 1 times [2022-11-25 18:14:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:42,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744626419] [2022-11-25 18:14:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:42,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:14:42,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:42,396 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:14:42,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 18:14:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:43,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 18:14:43,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:47,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:51,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744626419] [2022-11-25 18:14:51,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744626419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:14:51,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [790957708] [2022-11-25 18:14:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:14:51,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:14:51,342 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:14:51,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-25 18:14:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:54,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 18:14:54,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:15:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:04,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:15:05,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [790957708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:15:05,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:15:05,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2022-11-25 18:15:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237571423] [2022-11-25 18:15:05,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:15:05,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 18:15:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:15:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 18:15:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:15:05,536 INFO L87 Difference]: Start difference. First operand 200 states and 243 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-25 18:15:08,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:15:10,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:15:12,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:15:14,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:15:16,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:15:18,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:15:20,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:15:22,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:15:24,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:15:26,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:16:01,546 WARN L233 SmtUtils]: Spent 32.52s on a formula simplification. DAG size of input: 107 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:16:06,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:16:17,462 WARN L233 SmtUtils]: Spent 10.33s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:17:10,973 WARN L233 SmtUtils]: Spent 52.90s on a formula simplification. DAG size of input: 148 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:17:17,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:17:19,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:17:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:22,729 INFO L93 Difference]: Finished difference Result 551 states and 660 transitions. [2022-11-25 18:17:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:17:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 47 [2022-11-25 18:17:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:22,733 INFO L225 Difference]: With dead ends: 551 [2022-11-25 18:17:22,733 INFO L226 Difference]: Without dead ends: 433 [2022-11-25 18:17:22,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 113.3s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 18:17:22,735 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 313 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 48 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:22,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1239 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 777 Invalid, 13 Unknown, 0 Unchecked, 36.6s Time] [2022-11-25 18:17:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-25 18:17:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 327. [2022-11-25 18:17:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 240 states have (on average 1.1625) internal successors, (279), 254 states have internal predecessors, (279), 54 states have call successors, (54), 23 states have call predecessors, (54), 32 states have return successors, (63), 49 states have call predecessors, (63), 48 states have call successors, (63) [2022-11-25 18:17:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 396 transitions. [2022-11-25 18:17:22,817 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 396 transitions. Word has length 47 [2022-11-25 18:17:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:22,818 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 396 transitions. [2022-11-25 18:17:22,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-25 18:17:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 396 transitions. [2022-11-25 18:17:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:17:22,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:22,820 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 18:17:22,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:23,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:23,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:17:23,232 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:17:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2127107650, now seen corresponding path program 1 times [2022-11-25 18:17:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:17:23,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183984463] [2022-11-25 18:17:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:23,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:17:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:17:23,236 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:17:23,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 18:17:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:24,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:17:24,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:17:27,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:30,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:17:30,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183984463] [2022-11-25 18:17:30,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183984463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:30,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [889851240] [2022-11-25 18:17:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:30,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:17:30,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:17:30,620 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:17:30,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-25 18:17:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:33,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:17:33,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:33,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:17:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:17:35,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:36,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [889851240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:36,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:36,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-11-25 18:17:36,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383283722] [2022-11-25 18:17:36,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:36,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:17:36,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:17:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:17:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:17:36,793 INFO L87 Difference]: Start difference. First operand 327 states and 396 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 18:17:39,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:17:41,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:17:43,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:17:45,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:17:47,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:17:53,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:17:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:55,440 INFO L93 Difference]: Finished difference Result 666 states and 800 transitions. [2022-11-25 18:17:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:17:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2022-11-25 18:17:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:55,445 INFO L225 Difference]: With dead ends: 666 [2022-11-25 18:17:55,445 INFO L226 Difference]: Without dead ends: 479 [2022-11-25 18:17:55,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:17:55,446 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 138 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:55,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 677 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 401 Invalid, 5 Unknown, 0 Unchecked, 16.9s Time] [2022-11-25 18:17:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-25 18:17:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 434. [2022-11-25 18:17:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 308 states have (on average 1.1396103896103895) internal successors, (351), 327 states have internal predecessors, (351), 80 states have call successors, (80), 33 states have call predecessors, (80), 45 states have return successors, (91), 73 states have call predecessors, (91), 70 states have call successors, (91) [2022-11-25 18:17:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 522 transitions. [2022-11-25 18:17:55,554 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 522 transitions. Word has length 47 [2022-11-25 18:17:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:55,554 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 522 transitions. [2022-11-25 18:17:55,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 18:17:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 522 transitions. [2022-11-25 18:17:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:17:55,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:55,556 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:55,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:55,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:55,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:17:55,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:17:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1812092171, now seen corresponding path program 1 times [2022-11-25 18:17:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:17:55,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003570462] [2022-11-25 18:17:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:17:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:17:55,973 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:17:55,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 18:17:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:57,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:17:57,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:57,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:17:57,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:17:58,365 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:17:58,365 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 34 treesize of output 10 [2022-11-25 18:17:58,377 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:17:58,377 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 34 treesize of output 10 [2022-11-25 18:17:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:17:58,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:17:59,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:17:59,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003570462] [2022-11-25 18:17:59,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003570462] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:59,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:17:59,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2022-11-25 18:17:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506626281] [2022-11-25 18:17:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:59,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:17:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:17:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:17:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:17:59,095 INFO L87 Difference]: Start difference. First operand 434 states and 522 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:18:01,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:18:03,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:18:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:18:08,859 INFO L93 Difference]: Finished difference Result 456 states and 543 transitions. [2022-11-25 18:18:08,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:18:08,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-11-25 18:18:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:18:08,864 INFO L225 Difference]: With dead ends: 456 [2022-11-25 18:18:08,864 INFO L226 Difference]: Without dead ends: 454 [2022-11-25 18:18:08,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:18:08,867 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:18:08,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 509 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-11-25 18:18:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-25 18:18:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2022-11-25 18:18:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 323 states have (on average 1.13312693498452) internal successors, (366), 342 states have internal predecessors, (366), 80 states have call successors, (80), 38 states have call predecessors, (80), 50 states have return successors, (91), 73 states have call predecessors, (91), 70 states have call successors, (91) [2022-11-25 18:18:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 537 transitions. [2022-11-25 18:18:09,032 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 537 transitions. Word has length 49 [2022-11-25 18:18:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:18:09,032 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 537 transitions. [2022-11-25 18:18:09,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:18:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 537 transitions. [2022-11-25 18:18:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:18:09,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:18:09,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:09,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:09,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:18:09,251 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:18:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 547482018, now seen corresponding path program 1 times [2022-11-25 18:18:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:18:09,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244170873] [2022-11-25 18:18:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:09,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:18:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:18:09,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:18:09,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 18:18:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:21,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 18:18:21,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:21,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:21,848 INFO L217 Elim1Store]: Index analysis took 213 ms [2022-11-25 18:18:21,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 285 [2022-11-25 18:18:21,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:18:21,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:18:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:18:30,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:18:30,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:18:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244170873] [2022-11-25 18:18:30,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244170873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:18:30,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:18:30,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 18:18:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619774074] [2022-11-25 18:18:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:18:30,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:18:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:18:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:18:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:18:30,399 INFO L87 Difference]: Start difference. First operand 454 states and 537 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:18:32,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:34,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:36,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:18:39,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:18:41,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:43,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:18:45,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:47,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:49,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:51,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:18:53,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:55,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:57,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:19:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:19:11,799 INFO L93 Difference]: Finished difference Result 557 states and 648 transitions. [2022-11-25 18:19:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:19:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2022-11-25 18:19:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:19:11,805 INFO L225 Difference]: With dead ends: 557 [2022-11-25 18:19:11,805 INFO L226 Difference]: Without dead ends: 482 [2022-11-25 18:19:11,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:19:11,807 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 187 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 48 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:19:11,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1084 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 587 Invalid, 12 Unknown, 0 Unchecked, 35.8s Time] [2022-11-25 18:19:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-25 18:19:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 382. [2022-11-25 18:19:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 273 states have (on average 1.1355311355311355) internal successors, (310), 289 states have internal predecessors, (310), 65 states have call successors, (65), 33 states have call predecessors, (65), 43 states have return successors, (74), 59 states have call predecessors, (74), 57 states have call successors, (74) [2022-11-25 18:19:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 449 transitions. [2022-11-25 18:19:11,956 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 449 transitions. Word has length 56 [2022-11-25 18:19:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:19:11,957 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 449 transitions. [2022-11-25 18:19:11,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:19:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 449 transitions. [2022-11-25 18:19:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:19:11,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:19:11,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:11,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:12,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:19:12,163 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:19:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -732381660, now seen corresponding path program 1 times [2022-11-25 18:19:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:19:12,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099483649] [2022-11-25 18:19:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:12,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:19:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:19:12,166 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:19:12,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 18:19:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:23,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:19:23,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:23,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:23,779 INFO L217 Elim1Store]: Index analysis took 161 ms [2022-11-25 18:19:23,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:23,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 161 [2022-11-25 18:19:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:19:31,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:19:31,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:19:31,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099483649] [2022-11-25 18:19:31,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099483649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:31,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:31,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:19:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352131137] [2022-11-25 18:19:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:31,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:19:31,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:19:31,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:19:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:19:31,586 INFO L87 Difference]: Start difference. First operand 382 states and 449 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:19:34,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:19:36,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:19:37,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:19:39,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:19:52,595 WARN L233 SmtUtils]: Spent 11.03s on a formula simplification. DAG size of input: 159 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:19:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:19:58,827 INFO L93 Difference]: Finished difference Result 401 states and 469 transitions. [2022-11-25 18:19:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:19:58,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-11-25 18:19:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:19:58,831 INFO L225 Difference]: With dead ends: 401 [2022-11-25 18:19:58,831 INFO L226 Difference]: Without dead ends: 326 [2022-11-25 18:19:58,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:19:58,833 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 168 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:19:58,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 391 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2022-11-25 18:19:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-25 18:19:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 293. [2022-11-25 18:19:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 221 states have internal predecessors, (237), 50 states have call successors, (50), 26 states have call predecessors, (50), 33 states have return successors, (55), 45 states have call predecessors, (55), 44 states have call successors, (55) [2022-11-25 18:19:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 342 transitions. [2022-11-25 18:19:58,960 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 342 transitions. Word has length 56 [2022-11-25 18:19:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:19:58,961 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 342 transitions. [2022-11-25 18:19:58,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:19:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 342 transitions. [2022-11-25 18:19:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:19:58,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:19:58,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:58,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-25 18:19:59,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:19:59,171 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:19:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1299031322, now seen corresponding path program 1 times [2022-11-25 18:19:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:19:59,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068515970] [2022-11-25 18:19:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:59,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:19:59,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:19:59,174 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:19:59,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-25 18:20:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:00,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:20:00,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:20:00,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:20:00,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:20:00,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068515970] [2022-11-25 18:20:00,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068515970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:00,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:00,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040039818] [2022-11-25 18:20:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:00,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:20:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:00,094 INFO L87 Difference]: Start difference. First operand 293 states and 342 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:20:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:00,242 INFO L93 Difference]: Finished difference Result 406 states and 480 transitions. [2022-11-25 18:20:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2022-11-25 18:20:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:00,244 INFO L225 Difference]: With dead ends: 406 [2022-11-25 18:20:00,245 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 18:20:00,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:00,246 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 27 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:00,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 322 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:20:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 18:20:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2022-11-25 18:20:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 147 states have (on average 1.1088435374149659) internal successors, (163), 156 states have internal predecessors, (163), 36 states have call successors, (36), 19 states have call predecessors, (36), 24 states have return successors, (40), 32 states have call predecessors, (40), 32 states have call successors, (40) [2022-11-25 18:20:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2022-11-25 18:20:00,323 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 56 [2022-11-25 18:20:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:00,323 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2022-11-25 18:20:00,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:20:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2022-11-25 18:20:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:20:00,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:00,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:00,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-25 18:20:00,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:20:00,525 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:20:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1716072296, now seen corresponding path program 1 times [2022-11-25 18:20:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:20:00,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229989141] [2022-11-25 18:20:00,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:20:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:20:00,529 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:20:00,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 18:20:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:13,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 18:20:13,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:13,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:13,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 425 [2022-11-25 18:20:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:20:20,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:20:20,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:20:20,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229989141] [2022-11-25 18:20:20,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229989141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:20,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:20,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:20:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591990311] [2022-11-25 18:20:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:20,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:20:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:20:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:20:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:20:20,864 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:20:23,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:25,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:27,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:29,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:20:32,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:35,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:20:37,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:39,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:20:41,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:20:43,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:20:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:49,010 INFO L93 Difference]: Finished difference Result 401 states and 463 transitions. [2022-11-25 18:20:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:20:49,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2022-11-25 18:20:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:49,013 INFO L225 Difference]: With dead ends: 401 [2022-11-25 18:20:49,013 INFO L226 Difference]: Without dead ends: 280 [2022-11-25 18:20:49,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:20:49,014 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 28 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:49,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1231 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 25.2s Time] [2022-11-25 18:20:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-25 18:20:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 218. [2022-11-25 18:20:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 157 states have (on average 1.10828025477707) internal successors, (174), 164 states have internal predecessors, (174), 36 states have call successors, (36), 21 states have call predecessors, (36), 24 states have return successors, (35), 32 states have call predecessors, (35), 32 states have call successors, (35) [2022-11-25 18:20:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 245 transitions. [2022-11-25 18:20:49,107 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 245 transitions. Word has length 56 [2022-11-25 18:20:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:49,107 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 245 transitions. [2022-11-25 18:20:49,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:20:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 245 transitions. [2022-11-25 18:20:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 18:20:49,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:49,109 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:49,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-11-25 18:20:49,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:20:49,320 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:20:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2542371, now seen corresponding path program 1 times [2022-11-25 18:20:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:20:49,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548644492] [2022-11-25 18:20:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:20:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:20:49,323 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:20:49,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-25 18:20:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:20:50,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:53,220 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:20:53,221 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-25 18:20:53,235 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:20:53,235 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-25 18:20:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:20:53,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:20:54,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:20:54,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548644492] [2022-11-25 18:20:54,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548644492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:54,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [763158307] [2022-11-25 18:20:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:54,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:20:54,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:20:54,242 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:20:54,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-25 18:21:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:00,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 18:21:00,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:00,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:21:02,615 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:21:02,616 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-25 18:21:02,628 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:21:02,628 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-25 18:21:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:21:02,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:21:02,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [763158307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:02,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:21:02,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2022-11-25 18:21:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952261632] [2022-11-25 18:21:02,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:21:02,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:21:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:21:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:21:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:21:02,934 INFO L87 Difference]: Start difference. First operand 218 states and 245 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:21:05,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:07,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:09,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:11,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:13,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:15,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:17,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:38,345 WARN L233 SmtUtils]: Spent 20.19s on a formula simplification. DAG size of input: 31 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:21:53,849 WARN L233 SmtUtils]: Spent 13.82s on a formula simplification. DAG size of input: 40 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:21:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:56,086 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2022-11-25 18:21:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:21:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-25 18:21:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:56,090 INFO L225 Difference]: With dead ends: 240 [2022-11-25 18:21:56,090 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 18:21:56,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:21:56,091 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:56,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 853 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 396 Invalid, 6 Unknown, 0 Unchecked, 17.5s Time] [2022-11-25 18:21:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 18:21:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2022-11-25 18:21:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 147 states have (on average 1.1088435374149659) internal successors, (163), 153 states have internal predecessors, (163), 30 states have call successors, (30), 19 states have call predecessors, (30), 22 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-11-25 18:21:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2022-11-25 18:21:56,169 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 56 [2022-11-25 18:21:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:56,169 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2022-11-25 18:21:56,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:21:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2022-11-25 18:21:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 18:21:56,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:56,170 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:56,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:56,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:56,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:21:56,571 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:56,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 606528505, now seen corresponding path program 1 times [2022-11-25 18:21:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:21:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907493732] [2022-11-25 18:21:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:56,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:21:56,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:21:56,575 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:21:56,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 18:21:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:57,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:21:57,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 18:21:57,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:21:57,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:21:57,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907493732] [2022-11-25 18:21:57,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907493732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:57,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:57,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:21:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143818771] [2022-11-25 18:21:57,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:57,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:21:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:21:57,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:21:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:21:57,894 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:21:59,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:01,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:03,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:04,078 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2022-11-25 18:22:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:22:04,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-11-25 18:22:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:04,081 INFO L225 Difference]: With dead ends: 230 [2022-11-25 18:22:04,082 INFO L226 Difference]: Without dead ends: 218 [2022-11-25 18:22:04,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:22:04,082 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:04,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 301 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 18:22:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-25 18:22:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2022-11-25 18:22:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 153 states have (on average 1.1045751633986929) internal successors, (169), 158 states have internal predecessors, (169), 34 states have call successors, (34), 19 states have call predecessors, (34), 22 states have return successors, (34), 32 states have call predecessors, (34), 31 states have call successors, (34) [2022-11-25 18:22:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 237 transitions. [2022-11-25 18:22:04,192 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 237 transitions. Word has length 57 [2022-11-25 18:22:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:04,193 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 237 transitions. [2022-11-25 18:22:04,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:22:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 237 transitions. [2022-11-25 18:22:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:22:04,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:04,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:04,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-25 18:22:04,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:22:04,419 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2045643665, now seen corresponding path program 1 times [2022-11-25 18:22:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:22:04,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808321479] [2022-11-25 18:22:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:04,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:22:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:22:04,424 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:22:04,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9785e60b-bb61-4186-83b5-56437106ffd8/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 18:22:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 18:22:16,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:22:17,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:22:17,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:22:17,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:22:17,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:22:17,448 INFO L217 Elim1Store]: Index analysis took 249 ms [2022-11-25 18:22:17,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 153 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 409 [2022-11-25 18:22:17,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:22:29,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:29,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2330 treesize of output 2334 [2022-11-25 18:22:30,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:30,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 28 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 192 case distinctions, treesize of input 2349 treesize of output 2381 [2022-11-25 18:22:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:35,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:22:35,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:22:35,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808321479] [2022-11-25 18:22:35,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808321479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:35,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:35,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-25 18:22:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857312560] [2022-11-25 18:22:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:35,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:22:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:22:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:22:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:22:35,970 INFO L87 Difference]: Start difference. First operand 210 states and 237 transitions. Second operand has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:22:38,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:40,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:43,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:44,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:46,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:48,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:50,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:52,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:54,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:56,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:22:58,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:23:00,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:04,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []