./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 2329fc70 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 16:00:57,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:00:57,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:00:57,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:00:57,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:00:57,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:00:57,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:00:57,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:00:57,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:00:57,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:00:57,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:00:57,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:00:57,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:00:57,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:00:57,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:00:57,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:00:57,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:00:57,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:00:57,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:00:57,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:00:57,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:00:57,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:00:57,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:00:57,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:00:57,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:00:57,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:00:57,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:00:57,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:00:57,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:00:57,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:00:57,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:00:57,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:00:57,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:00:57,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:00:57,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:00:57,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:00:57,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:00:57,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:00:57,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:00:57,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:00:57,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:00:57,099 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 16:00:57,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:00:57,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:00:57,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:00:57,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:00:57,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:00:57,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:00:57,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:00:57,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:00:57,131 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:00:57,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:00:57,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:00:57,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:00:57,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:00:57,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:00:57,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:00:57,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:00:57,133 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:00:57,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:00:57,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:00:57,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:00:57,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:00:57,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:00:57,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:00:57,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:00:57,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:00:57,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:00:57,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:00:57,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:00:57,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:00:57,135 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:00:57,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:00:57,135 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:00:57,135 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8 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-12-13 16:00:57,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:00:57,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:00:57,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:00:57,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:00:57,340 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:00:57,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-12-13 16:00:59,910 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:01:00,206 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:01:00,207 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-12-13 16:01:00,224 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data/33d31e3e8/a035193ab0234430a3db5647600d51c1/FLAGcab551d31 [2022-12-13 16:01:00,470 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data/33d31e3e8/a035193ab0234430a3db5647600d51c1 [2022-12-13 16:01:00,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:01:00,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:01:00,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:01:00,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:01:00,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:01:00,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:01:00" (1/1) ... [2022-12-13 16:01:00,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35619380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:00, skipping insertion in model container [2022-12-13 16:01:00,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:01:00" (1/1) ... [2022-12-13 16:01:00,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:01:00,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:01:00,734 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-12-13 16:01:00,740 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-12-13 16:01:01,391 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,392 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,392 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,393 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,394 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,403 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,404 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,405 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,406 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,494 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:01:01,494 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:01:01,495 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:01:01,498 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:01:01,500 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:01:01,500 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:01:01,760 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:01:01,761 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:01:01,762 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:01:01,762 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:01:01,763 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:01:01,764 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:01:01,765 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:01:01,765 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:01:01,766 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:01:01,766 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:01:01,767 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:01:01,902 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:01:01,942 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 16:01:01,957 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:01:01,977 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:01:01,983 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:01,983 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,022 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 16:01:02,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:01:02,062 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:01:02,072 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-12-13 16:01:02,072 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-12-13 16:01:02,098 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,098 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,099 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,099 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,100 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,104 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,105 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,105 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,106 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,111 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:01:02,111 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:01:02,111 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:01:02,114 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:01:02,115 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:01:02,115 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:01:02,130 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:01:02,130 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:01:02,131 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:01:02,131 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:01:02,132 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:01:02,133 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:01:02,133 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:01:02,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:01:02,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:01:02,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:01:02,135 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:01:02,150 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:01:02,164 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 16:01:02,168 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:01:02,179 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:01:02,183 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,183 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:01:02,199 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 16:01:02,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:01:02,331 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:01:02,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02 WrapperNode [2022-12-13 16:01:02,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:01:02,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:01:02,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:01:02,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:01:02,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,428 INFO L138 Inliner]: procedures = 690, calls = 2621, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 823 [2022-12-13 16:01:02,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:01:02,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:01:02,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:01:02,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:01:02,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,476 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:01:02,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:01:02,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:01:02,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:01:02,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (1/1) ... [2022-12-13 16:01:02,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:01:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:01:02,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:01:02,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:01:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-12-13 16:01:02,536 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-12-13 16:01:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-12-13 16:01:02,537 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 16:01:02,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:01:02,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:01:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 16:01:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 16:01:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 16:01:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 16:01:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:01:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:01:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 16:01:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 16:01:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 16:01:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:01:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:01:02,725 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:01:02,727 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:01:03,557 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:01:03,562 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:01:03,562 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:01:03,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:01:03 BoogieIcfgContainer [2022-12-13 16:01:03,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:01:03,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:01:03,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:01:03,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:01:03,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:01:00" (1/3) ... [2022-12-13 16:01:03,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55049bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:01:03, skipping insertion in model container [2022-12-13 16:01:03,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:01:02" (2/3) ... [2022-12-13 16:01:03,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55049bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:01:03, skipping insertion in model container [2022-12-13 16:01:03,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:01:03" (3/3) ... [2022-12-13 16:01:03,570 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_c_str_harness.i [2022-12-13 16:01:03,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:01:03,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:01:03,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:01:03,622 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;@6f6bfda6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:01:03,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:01:03,626 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-12-13 16:01:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 16:01:03,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:03,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:01:03,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1479345354, now seen corresponding path program 1 times [2022-12-13 16:01:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799055508] [2022-12-13 16:01:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:04,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799055508] [2022-12-13 16:01:04,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799055508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:04,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:04,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:01:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944642405] [2022-12-13 16:01:04,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:04,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:01:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:04,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:01:04,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:01:04,302 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-12-13 16:01:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:04,350 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2022-12-13 16:01:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:01:04,352 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-12-13 16:01:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:04,359 INFO L225 Difference]: With dead ends: 167 [2022-12-13 16:01:04,359 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 16:01:04,362 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-12-13 16:01:04,364 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-12-13 16:01:04,364 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-12-13 16:01:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 16:01:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-12-13 16:01:04,393 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-12-13 16:01:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-12-13 16:01:04,395 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 18 [2022-12-13 16:01:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:04,396 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-12-13 16:01:04,396 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-12-13 16:01:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-12-13 16:01:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:01:04,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:04,397 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-12-13 16:01:04,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:01:04,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -409891947, now seen corresponding path program 1 times [2022-12-13 16:01:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609307704] [2022-12-13 16:01:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:05,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609307704] [2022-12-13 16:01:05,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609307704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:05,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:05,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803217179] [2022-12-13 16:01:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:05,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:05,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:05,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:05,017 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-12-13 16:01:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:05,106 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-12-13 16:01:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:01:05,107 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-12-13 16:01:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:05,108 INFO L225 Difference]: With dead ends: 94 [2022-12-13 16:01:05,109 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 16:01:05,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:05,110 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-13 16:01:05,110 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-12-13 16:01:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 16:01:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-12-13 16:01:05,117 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-12-13 16:01:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2022-12-13 16:01:05,118 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 24 [2022-12-13 16:01:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:05,118 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2022-12-13 16:01:05,118 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-12-13 16:01:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-12-13 16:01:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:01:05,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:05,119 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-12-13 16:01:05,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:01:05,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 113995101, now seen corresponding path program 1 times [2022-12-13 16:01:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:05,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475214081] [2022-12-13 16:01:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:06,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475214081] [2022-12-13 16:01:06,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475214081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:06,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:06,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:01:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211669037] [2022-12-13 16:01:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:06,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:01:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:01:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:01:06,456 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-12-13 16:01:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:06,683 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2022-12-13 16:01:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:01:06,684 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-12-13 16:01:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:06,685 INFO L225 Difference]: With dead ends: 185 [2022-12-13 16:01:06,685 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 16:01:06,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:01:06,687 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:06,687 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.2s Time] [2022-12-13 16:01:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 16:01:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2022-12-13 16:01:06,698 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-12-13 16:01:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2022-12-13 16:01:06,700 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2022-12-13 16:01:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:06,700 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2022-12-13 16:01:06,700 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-12-13 16:01:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-12-13 16:01:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:01:06,701 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:06,701 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-12-13 16:01:06,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:01:06,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash 372160539, now seen corresponding path program 1 times [2022-12-13 16:01:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:06,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168344344] [2022-12-13 16:01:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:08,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168344344] [2022-12-13 16:01:08,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168344344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:08,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:08,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140728601] [2022-12-13 16:01:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:08,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:08,057 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-12-13 16:01:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:08,333 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2022-12-13 16:01:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:08,334 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-12-13 16:01:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:08,335 INFO L225 Difference]: With dead ends: 187 [2022-12-13 16:01:08,335 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 16:01:08,336 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-12-13 16:01:08,337 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 52 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:08,337 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.2s Time] [2022-12-13 16:01:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 16:01:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-12-13 16:01:08,348 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-12-13 16:01:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-12-13 16:01:08,350 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 28 [2022-12-13 16:01:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:08,350 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-12-13 16:01:08,350 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-12-13 16:01:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-12-13 16:01:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:01:08,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:08,352 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-12-13 16:01:08,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:01:08,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash -907703139, now seen corresponding path program 1 times [2022-12-13 16:01:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:08,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549987147] [2022-12-13 16:01:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:09,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:09,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549987147] [2022-12-13 16:01:09,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549987147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:09,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:09,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:01:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16062117] [2022-12-13 16:01:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:09,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:01:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:01:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:01:09,225 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-12-13 16:01:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:09,438 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2022-12-13 16:01:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:01:09,438 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-12-13 16:01:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:09,440 INFO L225 Difference]: With dead ends: 227 [2022-12-13 16:01:09,440 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 16:01:09,441 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-12-13 16:01:09,441 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-12-13 16:01:09,442 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-12-13 16:01:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 16:01:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-12-13 16:01:09,453 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-12-13 16:01:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-12-13 16:01:09,454 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 28 [2022-12-13 16:01:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:09,454 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-12-13 16:01:09,454 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-12-13 16:01:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-12-13 16:01:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:01:09,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:09,456 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-12-13 16:01:09,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:01:09,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:09,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1540750817, now seen corresponding path program 1 times [2022-12-13 16:01:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:09,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515413724] [2022-12-13 16:01:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:10,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515413724] [2022-12-13 16:01:10,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515413724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:10,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:10,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231783186] [2022-12-13 16:01:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:10,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:10,262 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-12-13 16:01:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:10,480 INFO L93 Difference]: Finished difference Result 230 states and 296 transitions. [2022-12-13 16:01:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:10,480 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-12-13 16:01:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:10,481 INFO L225 Difference]: With dead ends: 230 [2022-12-13 16:01:10,481 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 16:01:10,482 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-12-13 16:01:10,483 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 25 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12-13 16:01:10,483 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-12-13 16:01:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 16:01:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2022-12-13 16:01:10,494 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-12-13 16:01:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2022-12-13 16:01:10,495 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 28 [2022-12-13 16:01:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:10,496 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2022-12-13 16:01:10,496 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-12-13 16:01:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-12-13 16:01:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:01:10,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:10,497 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-12-13 16:01:10,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:01:10,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1798916255, now seen corresponding path program 1 times [2022-12-13 16:01:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:10,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900412867] [2022-12-13 16:01:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:10,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:10,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900412867] [2022-12-13 16:01:10,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900412867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:10,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:10,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:01:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818367652] [2022-12-13 16:01:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:10,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:01:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:01:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:01:10,898 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-12-13 16:01:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:11,006 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-12-13 16:01:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:01:11,006 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-12-13 16:01:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:11,007 INFO L225 Difference]: With dead ends: 218 [2022-12-13 16:01:11,007 INFO L226 Difference]: Without dead ends: 129 [2022-12-13 16:01:11,008 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-12-13 16:01:11,009 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-12-13 16:01:11,009 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-12-13 16:01:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-13 16:01:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2022-12-13 16:01:11,019 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-12-13 16:01:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-12-13 16:01:11,020 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2022-12-13 16:01:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:11,020 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-12-13 16:01:11,020 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-12-13 16:01:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-12-13 16:01:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 16:01:11,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:11,021 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-12-13 16:01:11,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:01:11,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash 568042278, now seen corresponding path program 1 times [2022-12-13 16:01:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:11,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101011292] [2022-12-13 16:01:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:11,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:11,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101011292] [2022-12-13 16:01:11,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101011292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:11,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:11,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304698831] [2022-12-13 16:01:11,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:11,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:11,531 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-12-13 16:01:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:11,634 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2022-12-13 16:01:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:01:11,634 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-12-13 16:01:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:11,636 INFO L225 Difference]: With dead ends: 136 [2022-12-13 16:01:11,636 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 16:01:11,636 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-12-13 16:01:11,637 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 31 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-13 16:01:11,637 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-12-13 16:01:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 16:01:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2022-12-13 16:01:11,647 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-12-13 16:01:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-12-13 16:01:11,648 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 30 [2022-12-13 16:01:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:11,649 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-12-13 16:01:11,649 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-12-13 16:01:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-12-13 16:01:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 16:01:11,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:11,650 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-12-13 16:01:11,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:01:11,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1269106856, now seen corresponding path program 1 times [2022-12-13 16:01:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:11,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824612267] [2022-12-13 16:01:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:01:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:12,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824612267] [2022-12-13 16:01:12,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824612267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:12,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:12,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212786315] [2022-12-13 16:01:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:12,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:12,437 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-12-13 16:01:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:12,632 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2022-12-13 16:01:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:01:12,632 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-12-13 16:01:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:12,634 INFO L225 Difference]: With dead ends: 222 [2022-12-13 16:01:12,634 INFO L226 Difference]: Without dead ends: 131 [2022-12-13 16:01:12,634 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-12-13 16:01:12,635 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12-13 16:01:12,635 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-12-13 16:01:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-13 16:01:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2022-12-13 16:01:12,639 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-12-13 16:01:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2022-12-13 16:01:12,640 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 30 [2022-12-13 16:01:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:12,640 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2022-12-13 16:01:12,640 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-12-13 16:01:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2022-12-13 16:01:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 16:01:12,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:12,641 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-12-13 16:01:12,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:01:12,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2009026791, now seen corresponding path program 1 times [2022-12-13 16:01:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:12,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127139821] [2022-12-13 16:01:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:01:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:12,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127139821] [2022-12-13 16:01:12,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127139821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:12,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:12,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:01:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304411284] [2022-12-13 16:01:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:12,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:01:12,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:01:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:01:12,868 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-12-13 16:01:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:12,894 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2022-12-13 16:01:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:01:12,894 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-12-13 16:01:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:12,895 INFO L225 Difference]: With dead ends: 150 [2022-12-13 16:01:12,895 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 16:01:12,895 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-12-13 16:01:12,896 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-12-13 16:01:12,896 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-12-13 16:01:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 16:01:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-12-13 16:01:12,900 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-12-13 16:01:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2022-12-13 16:01:12,901 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 37 [2022-12-13 16:01:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:12,901 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2022-12-13 16:01:12,901 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-12-13 16:01:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2022-12-13 16:01:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 16:01:12,902 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:12,902 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-12-13 16:01:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:01:12,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash -992924174, now seen corresponding path program 1 times [2022-12-13 16:01:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:12,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013053369] [2022-12-13 16:01:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 16:01:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:13,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013053369] [2022-12-13 16:01:13,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013053369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:13,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:13,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540114250] [2022-12-13 16:01:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:13,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:13,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:13,286 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-12-13 16:01:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:13,339 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2022-12-13 16:01:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:01:13,340 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-12-13 16:01:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:13,341 INFO L225 Difference]: With dead ends: 127 [2022-12-13 16:01:13,341 INFO L226 Difference]: Without dead ends: 125 [2022-12-13 16:01:13,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:13,342 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 23 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:13,342 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.0s Time] [2022-12-13 16:01:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-13 16:01:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-12-13 16:01:13,350 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-12-13 16:01:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 156 transitions. [2022-12-13 16:01:13,351 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 156 transitions. Word has length 43 [2022-12-13 16:01:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:13,351 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 156 transitions. [2022-12-13 16:01:13,351 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-12-13 16:01:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-12-13 16:01:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 16:01:13,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:13,352 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-12-13 16:01:13,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:01:13,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 999269368, now seen corresponding path program 1 times [2022-12-13 16:01:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:13,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174142903] [2022-12-13 16:01:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:14,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:01:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:14,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174142903] [2022-12-13 16:01:14,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174142903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:14,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:14,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391693142] [2022-12-13 16:01:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:14,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:14,485 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-12-13 16:01:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:14,877 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2022-12-13 16:01:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:01:14,877 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-12-13 16:01:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:14,878 INFO L225 Difference]: With dead ends: 206 [2022-12-13 16:01:14,878 INFO L226 Difference]: Without dead ends: 170 [2022-12-13 16:01:14,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:01:14,879 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:14,879 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.2s Time] [2022-12-13 16:01:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-13 16:01:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2022-12-13 16:01:14,886 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-12-13 16:01:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2022-12-13 16:01:14,887 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 47 [2022-12-13 16:01:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:14,887 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2022-12-13 16:01:14,887 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-12-13 16:01:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-12-13 16:01:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 16:01:14,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:14,888 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-12-13 16:01:14,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:01:14,888 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash -280594310, now seen corresponding path program 1 times [2022-12-13 16:01:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:14,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846244395] [2022-12-13 16:01:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:15,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:15,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:01:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:15,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846244395] [2022-12-13 16:01:15,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846244395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:15,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:15,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 16:01:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573641020] [2022-12-13 16:01:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:15,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 16:01:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 16:01:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:01:15,747 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-12-13 16:01:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:16,026 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2022-12-13 16:01:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:01:16,026 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-12-13 16:01:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:16,027 INFO L225 Difference]: With dead ends: 228 [2022-12-13 16:01:16,027 INFO L226 Difference]: Without dead ends: 187 [2022-12-13 16:01:16,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:01:16,028 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 103 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:16,028 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.2s Time] [2022-12-13 16:01:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-12-13 16:01:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 134. [2022-12-13 16:01:16,034 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-12-13 16:01:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2022-12-13 16:01:16,035 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 47 [2022-12-13 16:01:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:16,035 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2022-12-13 16:01:16,035 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-12-13 16:01:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2022-12-13 16:01:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 16:01:16,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:16,036 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-12-13 16:01:16,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:01:16,036 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:16,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2127107650, now seen corresponding path program 1 times [2022-12-13 16:01:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:16,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645003461] [2022-12-13 16:01:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:01:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:16,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645003461] [2022-12-13 16:01:16,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645003461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:16,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717835079] [2022-12-13 16:01:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:16,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:16,942 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-12-13 16:01:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:17,290 INFO L93 Difference]: Finished difference Result 215 states and 277 transitions. [2022-12-13 16:01:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:01:17,290 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-12-13 16:01:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:17,292 INFO L225 Difference]: With dead ends: 215 [2022-12-13 16:01:17,292 INFO L226 Difference]: Without dead ends: 179 [2022-12-13 16:01:17,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:01:17,293 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:17,293 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.3s Time] [2022-12-13 16:01:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-13 16:01:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2022-12-13 16:01:17,299 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-12-13 16:01:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2022-12-13 16:01:17,300 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 47 [2022-12-13 16:01:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:17,300 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2022-12-13 16:01:17,300 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-12-13 16:01:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2022-12-13 16:01:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 16:01:17,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:17,301 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-12-13 16:01:17,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:01:17,301 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1812092171, now seen corresponding path program 1 times [2022-12-13 16:01:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:17,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198391176] [2022-12-13 16:01:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:01:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:01:17,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:17,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198391176] [2022-12-13 16:01:17,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198391176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:17,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:17,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:17,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558928462] [2022-12-13 16:01:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:17,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:17,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:17,876 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-12-13 16:01:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:18,024 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2022-12-13 16:01:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:01:18,025 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-12-13 16:01:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:18,025 INFO L225 Difference]: With dead ends: 140 [2022-12-13 16:01:18,025 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 16:01:18,026 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-12-13 16:01:18,026 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:18,026 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.1s Time] [2022-12-13 16:01:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 16:01:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-12-13 16:01:18,033 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-12-13 16:01:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2022-12-13 16:01:18,033 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 49 [2022-12-13 16:01:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:18,034 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2022-12-13 16:01:18,034 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-12-13 16:01:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2022-12-13 16:01:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 16:01:18,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:18,035 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-12-13 16:01:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:01:18,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1736512573, now seen corresponding path program 1 times [2022-12-13 16:01:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:18,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171234080] [2022-12-13 16:01:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 16:01:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:18,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171234080] [2022-12-13 16:01:18,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171234080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:18,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:18,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738335340] [2022-12-13 16:01:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:18,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:18,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:18,486 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-12-13 16:01:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:18,587 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-12-13 16:01:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:01:18,587 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-12-13 16:01:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:18,588 INFO L225 Difference]: With dead ends: 146 [2022-12-13 16:01:18,588 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 16:01:18,589 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-12-13 16:01:18,589 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 31 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-13 16:01:18,589 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-12-13 16:01:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 16:01:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2022-12-13 16:01:18,596 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-12-13 16:01:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2022-12-13 16:01:18,597 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 49 [2022-12-13 16:01:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:18,597 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2022-12-13 16:01:18,597 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-12-13 16:01:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2022-12-13 16:01:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 16:01:18,598 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:18,598 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-12-13 16:01:18,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:01:18,598 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1035447995, now seen corresponding path program 1 times [2022-12-13 16:01:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:18,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512687968] [2022-12-13 16:01:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:19,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:19,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:19,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:01:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512687968] [2022-12-13 16:01:19,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512687968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:19,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:19,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960256106] [2022-12-13 16:01:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:19,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:19,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:19,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:19,482 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-12-13 16:01:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:19,784 INFO L93 Difference]: Finished difference Result 202 states and 253 transitions. [2022-12-13 16:01:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:19,784 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-12-13 16:01:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:19,785 INFO L225 Difference]: With dead ends: 202 [2022-12-13 16:01:19,785 INFO L226 Difference]: Without dead ends: 162 [2022-12-13 16:01:19,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 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-12-13 16:01:19,786 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:19,786 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.3s Time] [2022-12-13 16:01:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-13 16:01:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2022-12-13 16:01:19,793 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-12-13 16:01:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2022-12-13 16:01:19,794 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 49 [2022-12-13 16:01:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:19,794 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2022-12-13 16:01:19,794 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-12-13 16:01:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2022-12-13 16:01:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:01:19,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:19,795 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-12-13 16:01:19,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 16:01:19,795 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 547482018, now seen corresponding path program 1 times [2022-12-13 16:01:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410706947] [2022-12-13 16:01:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:21,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410706947] [2022-12-13 16:01:21,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410706947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:21,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:21,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499046294] [2022-12-13 16:01:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:21,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:21,267 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-12-13 16:01:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:21,883 INFO L93 Difference]: Finished difference Result 240 states and 296 transitions. [2022-12-13 16:01:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:01:21,884 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-12-13 16:01:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:21,885 INFO L225 Difference]: With dead ends: 240 [2022-12-13 16:01:21,885 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 16:01:21,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:01:21,885 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 160 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:21,886 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.4s Time] [2022-12-13 16:01:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 16:01:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-12-13 16:01:21,893 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-12-13 16:01:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2022-12-13 16:01:21,894 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 56 [2022-12-13 16:01:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:21,894 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2022-12-13 16:01:21,894 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-12-13 16:01:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2022-12-13 16:01:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:01:21,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:21,895 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-12-13 16:01:21,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 16:01:21,895 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:21,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:21,895 INFO L85 PathProgramCache]: Analyzing trace with hash -732381660, now seen corresponding path program 1 times [2022-12-13 16:01:21,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:21,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963767695] [2022-12-13 16:01:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:23,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:23,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963767695] [2022-12-13 16:01:23,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963767695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:23,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:23,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:01:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879747483] [2022-12-13 16:01:23,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:23,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:01:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:01:23,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:01:23,590 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-12-13 16:01:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:24,104 INFO L93 Difference]: Finished difference Result 277 states and 336 transitions. [2022-12-13 16:01:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:24,104 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-12-13 16:01:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:24,105 INFO L225 Difference]: With dead ends: 277 [2022-12-13 16:01:24,105 INFO L226 Difference]: Without dead ends: 165 [2022-12-13 16:01:24,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:01:24,107 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 161 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:24,107 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.4s Time] [2022-12-13 16:01:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-12-13 16:01:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2022-12-13 16:01:24,120 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-12-13 16:01:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-12-13 16:01:24,121 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 56 [2022-12-13 16:01:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:24,121 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-12-13 16:01:24,121 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-12-13 16:01:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-12-13 16:01:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:01:24,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:24,122 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-12-13 16:01:24,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 16:01:24,123 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1716072296, now seen corresponding path program 1 times [2022-12-13 16:01:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:24,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483125122] [2022-12-13 16:01:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:25,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483125122] [2022-12-13 16:01:25,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483125122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:25,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:25,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:01:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551896171] [2022-12-13 16:01:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:25,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:01:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:25,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:01:25,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:01:25,576 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-12-13 16:01:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:25,989 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-12-13 16:01:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:25,990 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-12-13 16:01:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:25,991 INFO L225 Difference]: With dead ends: 250 [2022-12-13 16:01:25,991 INFO L226 Difference]: Without dead ends: 153 [2022-12-13 16:01:25,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:01:25,991 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:25,991 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.3s Time] [2022-12-13 16:01:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-13 16:01:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 130. [2022-12-13 16:01:25,999 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-12-13 16:01:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-12-13 16:01:26,000 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 56 [2022-12-13 16:01:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:26,000 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-12-13 16:01:26,000 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-12-13 16:01:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-12-13 16:01:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:01:26,001 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:26,001 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-12-13 16:01:26,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 16:01:26,002 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2542371, now seen corresponding path program 1 times [2022-12-13 16:01:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:26,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834655171] [2022-12-13 16:01:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:01:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:01:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 16:01:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:26,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834655171] [2022-12-13 16:01:26,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834655171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:26,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:26,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:01:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810979301] [2022-12-13 16:01:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:26,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:01:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:01:26,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:01:26,621 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-12-13 16:01:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:26,807 INFO L93 Difference]: Finished difference Result 166 states and 203 transitions. [2022-12-13 16:01:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:01:26,807 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-12-13 16:01:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:26,808 INFO L225 Difference]: With dead ends: 166 [2022-12-13 16:01:26,808 INFO L226 Difference]: Without dead ends: 142 [2022-12-13 16:01:26,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:01:26,809 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 16 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:26,809 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.1s Time] [2022-12-13 16:01:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-13 16:01:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2022-12-13 16:01:26,817 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-12-13 16:01:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2022-12-13 16:01:26,818 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 56 [2022-12-13 16:01:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:26,818 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2022-12-13 16:01:26,818 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-12-13 16:01:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2022-12-13 16:01:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 16:01:26,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:26,819 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-12-13 16:01:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 16:01:26,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 606528505, now seen corresponding path program 1 times [2022-12-13 16:01:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:26,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434365603] [2022-12-13 16:01:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:27,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:01:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:01:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 16:01:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:27,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434365603] [2022-12-13 16:01:27,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434365603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:27,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:27,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:01:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878949162] [2022-12-13 16:01:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:27,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:01:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:01:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:01:27,029 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-12-13 16:01:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:27,071 INFO L93 Difference]: Finished difference Result 152 states and 186 transitions. [2022-12-13 16:01:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:01:27,071 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-12-13 16:01:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:27,072 INFO L225 Difference]: With dead ends: 152 [2022-12-13 16:01:27,072 INFO L226 Difference]: Without dead ends: 140 [2022-12-13 16:01:27,073 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-12-13 16:01:27,073 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-12-13 16:01:27,073 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-12-13 16:01:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-13 16:01:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2022-12-13 16:01:27,081 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-12-13 16:01:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2022-12-13 16:01:27,082 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 57 [2022-12-13 16:01:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:27,082 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2022-12-13 16:01:27,082 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-12-13 16:01:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2022-12-13 16:01:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 16:01:27,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:27,083 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-12-13 16:01:27,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 16:01:27,083 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2045643665, now seen corresponding path program 1 times [2022-12-13 16:01:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:27,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480320132] [2022-12-13 16:01:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:29,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:29,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480320132] [2022-12-13 16:01:29,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480320132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:29,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-13 16:01:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433718876] [2022-12-13 16:01:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:29,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 16:01:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 16:01:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:01:29,057 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-12-13 16:01:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:30,352 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2022-12-13 16:01:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 16:01:30,353 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-12-13 16:01:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:30,353 INFO L225 Difference]: With dead ends: 159 [2022-12-13 16:01:30,353 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 16:01:30,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2022-12-13 16:01:30,354 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:30,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 823 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 16:01:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 16:01:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2022-12-13 16:01:30,364 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-12-13 16:01:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2022-12-13 16:01:30,364 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 58 [2022-12-13 16:01:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:30,365 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2022-12-13 16:01:30,366 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-12-13 16:01:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2022-12-13 16:01:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 16:01:30,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:30,366 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-12-13 16:01:30,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 16:01:30,366 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1686681515, now seen corresponding path program 1 times [2022-12-13 16:01:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:30,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772710489] [2022-12-13 16:01:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:01:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:01:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 16:01:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:31,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772710489] [2022-12-13 16:01:31,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772710489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:31,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:31,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:01:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527536786] [2022-12-13 16:01:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:31,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:01:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:01:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:01:31,183 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-12-13 16:01:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:31,366 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2022-12-13 16:01:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:31,367 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-12-13 16:01:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:31,367 INFO L225 Difference]: With dead ends: 149 [2022-12-13 16:01:31,367 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 16:01:31,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:01:31,368 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 14 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:31,368 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.1s Time] [2022-12-13 16:01:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 16:01:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-12-13 16:01:31,384 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-12-13 16:01:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 174 transitions. [2022-12-13 16:01:31,386 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 174 transitions. Word has length 58 [2022-12-13 16:01:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:31,386 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 174 transitions. [2022-12-13 16:01:31,386 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-12-13 16:01:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 174 transitions. [2022-12-13 16:01:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 16:01:31,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:31,387 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-12-13 16:01:31,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 16:01:31,388 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1219844092, now seen corresponding path program 1 times [2022-12-13 16:01:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:31,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115917980] [2022-12-13 16:01:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:01:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:01:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:01:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:01:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:01:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:01:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 16:01:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:32,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115917980] [2022-12-13 16:01:32,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115917980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:32,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:01:32,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:01:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35467008] [2022-12-13 16:01:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:01:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:01:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:01:32,241 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-12-13 16:01:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:32,419 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2022-12-13 16:01:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:01:32,419 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-12-13 16:01:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:32,420 INFO L225 Difference]: With dead ends: 153 [2022-12-13 16:01:32,420 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 16:01:32,421 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-12-13 16:01:32,421 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 13 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:32,421 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.1s Time] [2022-12-13 16:01:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 16:01:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-12-13 16:01:32,429 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-12-13 16:01:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2022-12-13 16:01:32,429 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 64 [2022-12-13 16:01:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:32,430 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2022-12-13 16:01:32,430 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-12-13 16:01:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2022-12-13 16:01:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 16:01:32,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:32,431 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-12-13 16:01:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 16:01:32,431 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1587339025, now seen corresponding path program 1 times [2022-12-13 16:01:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:32,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550886271] [2022-12-13 16:01:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:01:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:01:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 16:01:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:34,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550886271] [2022-12-13 16:01:34,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550886271] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:34,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177417484] [2022-12-13 16:01:34,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:01:34,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:01:34,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:01:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 2526 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 16:01:34,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:01:34,921 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-12-13 16:01:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:35,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:01:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177417484] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:36,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:01:36,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-12-13 16:01:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327080744] [2022-12-13 16:01:36,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:01:36,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 16:01:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:36,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 16:01:36,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 16:01:36,311 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-12-13 16:01:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:39,823 INFO L93 Difference]: Finished difference Result 317 states and 371 transitions. [2022-12-13 16:01:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 16:01:39,824 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-12-13 16:01:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:39,826 INFO L225 Difference]: With dead ends: 317 [2022-12-13 16:01:39,826 INFO L226 Difference]: Without dead ends: 255 [2022-12-13 16:01:39,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=451, Invalid=2519, Unknown=0, NotChecked=0, Total=2970 [2022-12-13 16:01:39,828 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 280 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:39,828 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.1s Time] [2022-12-13 16:01:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-13 16:01:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2022-12-13 16:01:39,842 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-12-13 16:01:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2022-12-13 16:01:39,843 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 75 [2022-12-13 16:01:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:39,843 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2022-12-13 16:01:39,843 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-12-13 16:01:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2022-12-13 16:01:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 16:01:39,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:39,844 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-12-13 16:01:39,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:01:40,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 16:01:40,045 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash 307475347, now seen corresponding path program 1 times [2022-12-13 16:01:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:40,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572707608] [2022-12-13 16:01:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:01:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:01:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:01:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572707608] [2022-12-13 16:01:41,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572707608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952575255] [2022-12-13 16:01:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:41,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:01:41,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:01:41,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:01:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:41,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 16:01:41,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:01:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:42,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:01:42,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952575255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:42,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:01:42,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2022-12-13 16:01:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002935949] [2022-12-13 16:01:42,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:01:42,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 16:01:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:42,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 16:01:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2022-12-13 16:01:42,903 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-12-13 16:01:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:45,434 INFO L93 Difference]: Finished difference Result 339 states and 401 transitions. [2022-12-13 16:01:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 16:01:45,435 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-12-13 16:01:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:45,436 INFO L225 Difference]: With dead ends: 339 [2022-12-13 16:01:45,436 INFO L226 Difference]: Without dead ends: 276 [2022-12-13 16:01:45,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2022-12-13 16:01:45,438 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 471 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:45,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 293 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 16:01:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-13 16:01:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 169. [2022-12-13 16:01:45,463 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-12-13 16:01:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2022-12-13 16:01:45,464 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 75 [2022-12-13 16:01:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:45,464 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2022-12-13 16:01:45,464 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-12-13 16:01:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2022-12-13 16:01:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 16:01:45,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:45,465 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-12-13 16:01:45,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:01:45,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:45,666 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1539037993, now seen corresponding path program 1 times [2022-12-13 16:01:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:45,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713072544] [2022-12-13 16:01:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:01:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:01:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:01:47,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713072544] [2022-12-13 16:01:47,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713072544] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470028781] [2022-12-13 16:01:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:01:47,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:01:47,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:01:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:47,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 16:01:47,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:01:47,507 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-12-13 16:01:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:48,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:01:48,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470028781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:48,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:01:48,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2022-12-13 16:01:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644462054] [2022-12-13 16:01:48,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:01:48,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 16:01:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 16:01:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 16:01:48,917 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-12-13 16:01:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:53,184 INFO L93 Difference]: Finished difference Result 325 states and 383 transitions. [2022-12-13 16:01:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 16:01:53,184 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-12-13 16:01:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:53,186 INFO L225 Difference]: With dead ends: 325 [2022-12-13 16:01:53,186 INFO L226 Difference]: Without dead ends: 275 [2022-12-13 16:01:53,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=448, Invalid=2632, Unknown=0, NotChecked=0, Total=3080 [2022-12-13 16:01:53,188 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 442 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:53,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 323 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-12-13 16:01:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-13 16:01:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 171. [2022-12-13 16:01:53,206 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-12-13 16:01:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2022-12-13 16:01:53,206 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 75 [2022-12-13 16:01:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:53,206 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2022-12-13 16:01:53,207 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-12-13 16:01:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-12-13 16:01:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 16:01:53,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:53,207 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-12-13 16:01:53,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:01:53,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 16:01:53,408 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1051011059, now seen corresponding path program 1 times [2022-12-13 16:01:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:53,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322841001] [2022-12-13 16:01:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:01:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:01:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 16:01:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:53,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322841001] [2022-12-13 16:01:53,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322841001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:53,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790518671] [2022-12-13 16:01:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:01:53,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:01:53,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:01:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:53,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:01:53,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:01:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 16:01:53,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:01:53,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790518671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:01:53,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:01:53,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 16:01:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365284524] [2022-12-13 16:01:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:01:53,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:01:53,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:01:53,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:01:53,878 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-12-13 16:01:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:53,906 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-12-13 16:01:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:01:53,906 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-12-13 16:01:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:53,907 INFO L225 Difference]: With dead ends: 296 [2022-12-13 16:01:53,907 INFO L226 Difference]: Without dead ends: 185 [2022-12-13 16:01:53,907 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-12-13 16:01:53,908 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-12-13 16:01:53,908 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-12-13 16:01:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-13 16:01:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2022-12-13 16:01:53,926 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-12-13 16:01:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 195 transitions. [2022-12-13 16:01:53,927 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 195 transitions. Word has length 75 [2022-12-13 16:01:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:53,927 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 195 transitions. [2022-12-13 16:01:53,927 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-12-13 16:01:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 195 transitions. [2022-12-13 16:01:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 16:01:53,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:53,928 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-12-13 16:01:53,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:01:54,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 16:01:54,129 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1458776606, now seen corresponding path program 1 times [2022-12-13 16:01:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:54,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431681210] [2022-12-13 16:01:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:01:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:01:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:01:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:01:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:01:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:01:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:01:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:01:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:01:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:01:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:01:55,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:01:55,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431681210] [2022-12-13 16:01:55,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431681210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:55,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840479978] [2022-12-13 16:01:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:55,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:55,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:01:55,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:01:55,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:01:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:01:55,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 2533 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 16:01:55,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:01:55,660 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-12-13 16:01:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:01:56,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:01:56,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840479978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:01:56,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:01:56,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2022-12-13 16:01:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458964394] [2022-12-13 16:01:56,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:01:56,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 16:01:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:01:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 16:01:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-12-13 16:01:56,581 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-12-13 16:01:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:01:59,704 INFO L93 Difference]: Finished difference Result 318 states and 370 transitions. [2022-12-13 16:01:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 16:01:59,705 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-12-13 16:01:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:01:59,705 INFO L225 Difference]: With dead ends: 318 [2022-12-13 16:01:59,706 INFO L226 Difference]: Without dead ends: 266 [2022-12-13 16:01:59,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=1660, Unknown=0, NotChecked=0, Total=1980 [2022-12-13 16:01:59,707 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 372 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:01:59,707 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.2s Time] [2022-12-13 16:01:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-13 16:01:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 211. [2022-12-13 16:01:59,733 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-12-13 16:01:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2022-12-13 16:01:59,734 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 77 [2022-12-13 16:01:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:01:59,734 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2022-12-13 16:01:59,734 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-12-13 16:01:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2022-12-13 16:01:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 16:01:59,735 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:01:59,735 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-12-13 16:01:59,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:01:59,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:01:59,937 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:01:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:01:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 237919648, now seen corresponding path program 1 times [2022-12-13 16:01:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:01:59,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348911797] [2022-12-13 16:01:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:01:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:02:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:02:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:02:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:02:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:02:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:02:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:02:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:02:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:02:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 16:02:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:01,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348911797] [2022-12-13 16:02:01,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348911797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:01,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:01,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 16:02:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212243848] [2022-12-13 16:02:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:01,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:02:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:02:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:02:01,558 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-12-13 16:02:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:02,325 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2022-12-13 16:02:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:02:02,326 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-12-13 16:02:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:02,327 INFO L225 Difference]: With dead ends: 271 [2022-12-13 16:02:02,327 INFO L226 Difference]: Without dead ends: 208 [2022-12-13 16:02:02,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:02:02,328 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 139 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:02,328 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.6s Time] [2022-12-13 16:02:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-13 16:02:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2022-12-13 16:02:02,368 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-12-13 16:02:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2022-12-13 16:02:02,368 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 81 [2022-12-13 16:02:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:02,369 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2022-12-13 16:02:02,369 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-12-13 16:02:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2022-12-13 16:02:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 16:02:02,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:02,370 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-12-13 16:02:02,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 16:02:02,370 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1041944030, now seen corresponding path program 1 times [2022-12-13 16:02:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:02,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554980901] [2022-12-13 16:02:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:02:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:02:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:02:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:02:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:02:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:02:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:02:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:02:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:02:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:02:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554980901] [2022-12-13 16:02:03,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554980901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:02:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585611380] [2022-12-13 16:02:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:03,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:02:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:02:03,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:02:03,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:02:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:03,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 16:02:03,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:03,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:03,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:03,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:03,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:03,583 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-12-13 16:02:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 16:02:03,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:02:03,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585611380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:03,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:02:03,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2022-12-13 16:02:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317585192] [2022-12-13 16:02:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:03,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:02:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:02:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-12-13 16:02:03,961 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-12-13 16:02:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:05,335 INFO L93 Difference]: Finished difference Result 325 states and 368 transitions. [2022-12-13 16:02:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:02:05,336 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-12-13 16:02:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:05,337 INFO L225 Difference]: With dead ends: 325 [2022-12-13 16:02:05,337 INFO L226 Difference]: Without dead ends: 223 [2022-12-13 16:02:05,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-12-13 16:02:05,337 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 98 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:05,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 400 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 16:02:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-13 16:02:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2022-12-13 16:02:05,367 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-12-13 16:02:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2022-12-13 16:02:05,368 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 81 [2022-12-13 16:02:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:05,368 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2022-12-13 16:02:05,368 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-12-13 16:02:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2022-12-13 16:02:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 16:02:05,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:05,369 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-12-13 16:02:05,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 16:02:05,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:02:05,571 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1009039968, now seen corresponding path program 1 times [2022-12-13 16:02:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:05,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259925279] [2022-12-13 16:02:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:02:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:02:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:02:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:02:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:02:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:02:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:02:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:02:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:02:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 16:02:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:07,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259925279] [2022-12-13 16:02:07,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259925279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:07,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:07,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 16:02:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712781729] [2022-12-13 16:02:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:07,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:02:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:07,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:02:07,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:02:07,576 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-12-13 16:02:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:08,365 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2022-12-13 16:02:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:02:08,365 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-12-13 16:02:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:08,366 INFO L225 Difference]: With dead ends: 264 [2022-12-13 16:02:08,366 INFO L226 Difference]: Without dead ends: 201 [2022-12-13 16:02:08,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:02:08,367 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 129 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:08,367 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.6s Time] [2022-12-13 16:02:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-13 16:02:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2022-12-13 16:02:08,399 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-12-13 16:02:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2022-12-13 16:02:08,400 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 81 [2022-12-13 16:02:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:08,400 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2022-12-13 16:02:08,400 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-12-13 16:02:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2022-12-13 16:02:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 16:02:08,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:08,401 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-12-13 16:02:08,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 16:02:08,401 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -837473372, now seen corresponding path program 1 times [2022-12-13 16:02:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:08,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689869964] [2022-12-13 16:02:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:02:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:02:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:02:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:02:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:02:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:02:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:02:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:02:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:02:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 16:02:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:10,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689869964] [2022-12-13 16:02:10,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689869964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:10,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:10,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:02:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790090513] [2022-12-13 16:02:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:02:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:02:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:02:10,310 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-12-13 16:02:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:10,991 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2022-12-13 16:02:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:02:10,991 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-12-13 16:02:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:10,992 INFO L225 Difference]: With dead ends: 231 [2022-12-13 16:02:10,992 INFO L226 Difference]: Without dead ends: 186 [2022-12-13 16:02:10,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 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-12-13 16:02:10,993 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:10,993 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.5s Time] [2022-12-13 16:02:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-12-13 16:02:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-12-13 16:02:11,030 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-12-13 16:02:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2022-12-13 16:02:11,030 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 81 [2022-12-13 16:02:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:11,031 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2022-12-13 16:02:11,031 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-12-13 16:02:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2022-12-13 16:02:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 16:02:11,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:11,031 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-12-13 16:02:11,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 16:02:11,031 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1007158230, now seen corresponding path program 1 times [2022-12-13 16:02:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:11,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749281430] [2022-12-13 16:02:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:02:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:02:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:02:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:02:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:02:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:02:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:02:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:02:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:02:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:02:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:02:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 16:02:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749281430] [2022-12-13 16:02:12,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749281430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:02:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670593704] [2022-12-13 16:02:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:02:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:02:12,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:02:12,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 16:02:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:12,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 2548 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 16:02:12,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:12,614 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-12-13 16:02:13,350 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:02:13,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-12-13 16:02:13,353 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:02:13,354 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-12-13 16:02:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 16:02:13,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:02:13,671 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 16:02:13,671 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-12-13 16:02:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 16:02:13,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670593704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:02:13,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:02:13,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 10] total 29 [2022-12-13 16:02:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170735128] [2022-12-13 16:02:13,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:02:13,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 16:02:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 16:02:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-12-13 16:02:13,733 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-12-13 16:02:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:15,791 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2022-12-13 16:02:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 16:02:15,792 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-12-13 16:02:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:15,792 INFO L225 Difference]: With dead ends: 230 [2022-12-13 16:02:15,792 INFO L226 Difference]: Without dead ends: 184 [2022-12-13 16:02:15,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 176 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=407, Invalid=2563, Unknown=0, NotChecked=0, Total=2970 [2022-12-13 16:02:15,793 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 276 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:15,794 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.1s Time] [2022-12-13 16:02:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-13 16:02:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2022-12-13 16:02:15,826 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-12-13 16:02:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2022-12-13 16:02:15,826 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 84 [2022-12-13 16:02:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:15,826 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2022-12-13 16:02:15,827 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-12-13 16:02:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2022-12-13 16:02:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 16:02:15,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:15,827 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-12-13 16:02:15,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 16:02:16,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:02:16,028 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -629419054, now seen corresponding path program 1 times [2022-12-13 16:02:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:16,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842439160] [2022-12-13 16:02:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:02:16,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:02:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:02:16,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:02:16,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:02:16,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 16:02:16,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 16:02:16,628 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-12-13 16:02:16,632 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:02:16,641 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,641 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-12-13 16:02:16,642 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-12-13 16:02:16,642 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-12-13 16:02:16,642 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-12-13 16:02:16,642 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-12-13 16:02:16,642 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,642 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-12-13 16:02:16,642 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,642 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-12-13 16:02:16,643 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-12-13 16:02:16,643 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-12-13 16:02:16,643 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-12-13 16:02:16,643 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-12-13 16:02:16,643 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,643 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-12-13 16:02:16,643 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,644 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-12-13 16:02:16,644 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-12-13 16:02:16,644 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-12-13 16:02:16,644 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-12-13 16:02:16,644 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-12-13 16:02:16,644 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,644 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-12-13 16:02:16,645 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,645 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-12-13 16:02:16,645 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-12-13 16:02:16,645 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-12-13 16:02:16,645 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-12-13 16:02:16,645 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-12-13 16:02:16,645 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,645 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-12-13 16:02:16,646 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,646 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,646 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-12-13 16:02:16,646 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,646 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-12-13 16:02:16,647 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-12-13 16:02:16,647 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,647 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-12-13 16:02:16,647 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,647 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-12-13 16:02:16,647 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-12-13 16:02:16,647 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-12-13 16:02:16,647 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-12-13 16:02:16,647 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-12-13 16:02:16,647 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,648 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-12-13 16:02:16,648 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,648 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,648 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-12-13 16:02:16,648 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,648 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-12-13 16:02:16,649 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-12-13 16:02:16,649 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,649 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-12-13 16:02:16,649 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,649 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-12-13 16:02:16,649 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-12-13 16:02:16,649 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-12-13 16:02:16,649 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-12-13 16:02:16,649 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-12-13 16:02:16,650 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,650 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-12-13 16:02:16,650 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,650 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-12-13 16:02:16,650 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-12-13 16:02:16,650 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-12-13 16:02:16,650 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-12-13 16:02:16,650 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-12-13 16:02:16,651 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,651 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-12-13 16:02:16,651 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,651 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-12-13 16:02:16,651 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-12-13 16:02:16,651 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-12-13 16:02:16,651 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-12-13 16:02:16,651 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-12-13 16:02:16,652 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,652 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-12-13 16:02:16,652 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,652 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-12-13 16:02:16,652 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-12-13 16:02:16,652 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-12-13 16:02:16,652 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-12-13 16:02:16,652 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-12-13 16:02:16,653 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,653 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-12-13 16:02:16,653 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,653 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-12-13 16:02:16,653 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-12-13 16:02:16,653 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-12-13 16:02:16,653 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-12-13 16:02:16,653 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-12-13 16:02:16,654 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,654 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-12-13 16:02:16,654 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,654 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-12-13 16:02:16,654 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-12-13 16:02:16,654 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-12-13 16:02:16,654 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-12-13 16:02:16,654 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-12-13 16:02:16,654 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,655 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-12-13 16:02:16,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,655 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-12-13 16:02:16,655 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-12-13 16:02:16,655 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-12-13 16:02:16,655 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-12-13 16:02:16,655 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-12-13 16:02:16,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,655 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-12-13 16:02:16,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,656 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-12-13 16:02:16,656 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-12-13 16:02:16,656 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-12-13 16:02:16,656 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-12-13 16:02:16,656 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-12-13 16:02:16,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,657 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-12-13 16:02:16,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,657 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-12-13 16:02:16,657 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-12-13 16:02:16,657 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-12-13 16:02:16,657 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-12-13 16:02:16,657 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-12-13 16:02:16,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,658 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-12-13 16:02:16,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,658 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-12-13 16:02:16,658 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-12-13 16:02:16,658 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-12-13 16:02:16,658 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-12-13 16:02:16,658 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-12-13 16:02:16,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,658 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-12-13 16:02:16,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,659 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-12-13 16:02:16,659 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-12-13 16:02:16,659 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-12-13 16:02:16,659 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-12-13 16:02:16,659 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-12-13 16:02:16,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,659 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-12-13 16:02:16,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,660 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-12-13 16:02:16,660 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-12-13 16:02:16,660 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-12-13 16:02:16,660 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-12-13 16:02:16,660 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-12-13 16:02:16,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,660 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-12-13 16:02:16,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,661 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-12-13 16:02:16,661 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-12-13 16:02:16,661 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-12-13 16:02:16,661 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-12-13 16:02:16,661 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-12-13 16:02:16,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,661 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-12-13 16:02:16,662 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,662 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-12-13 16:02:16,662 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-12-13 16:02:16,662 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-12-13 16:02:16,662 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-12-13 16:02:16,662 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-12-13 16:02:16,662 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,662 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-12-13 16:02:16,662 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,663 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-12-13 16:02:16,663 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-12-13 16:02:16,663 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-12-13 16:02:16,663 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-12-13 16:02:16,663 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-12-13 16:02:16,663 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,663 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-12-13 16:02:16,663 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,663 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-12-13 16:02:16,664 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-12-13 16:02:16,664 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-12-13 16:02:16,664 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-12-13 16:02:16,664 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-12-13 16:02:16,664 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,664 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-12-13 16:02:16,664 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,664 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-12-13 16:02:16,664 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-12-13 16:02:16,665 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-12-13 16:02:16,665 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-12-13 16:02:16,665 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-12-13 16:02:16,665 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,665 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-12-13 16:02:16,665 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,665 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-12-13 16:02:16,666 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-12-13 16:02:16,666 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-12-13 16:02:16,666 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-12-13 16:02:16,666 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-12-13 16:02:16,666 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,666 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-12-13 16:02:16,666 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,666 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-12-13 16:02:16,666 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-12-13 16:02:16,666 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-12-13 16:02:16,667 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-12-13 16:02:16,667 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-12-13 16:02:16,667 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,667 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-12-13 16:02:16,667 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,667 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-12-13 16:02:16,667 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-12-13 16:02:16,667 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-12-13 16:02:16,667 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-12-13 16:02:16,668 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-12-13 16:02:16,668 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,668 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-12-13 16:02:16,668 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,668 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-12-13 16:02:16,668 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-12-13 16:02:16,668 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-12-13 16:02:16,668 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-12-13 16:02:16,668 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-12-13 16:02:16,669 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,669 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-12-13 16:02:16,669 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,669 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-12-13 16:02:16,669 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-12-13 16:02:16,669 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-12-13 16:02:16,669 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-12-13 16:02:16,669 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-12-13 16:02:16,669 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,670 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-12-13 16:02:16,670 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,670 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-12-13 16:02:16,670 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-12-13 16:02:16,670 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-12-13 16:02:16,670 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-12-13 16:02:16,670 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-12-13 16:02:16,670 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,670 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-12-13 16:02:16,671 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,671 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-12-13 16:02:16,671 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-12-13 16:02:16,671 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-12-13 16:02:16,671 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-12-13 16:02:16,671 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-12-13 16:02:16,671 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,671 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-12-13 16:02:16,672 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,672 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-12-13 16:02:16,672 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-12-13 16:02:16,672 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-12-13 16:02:16,672 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-12-13 16:02:16,672 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-12-13 16:02:16,672 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,672 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-12-13 16:02:16,673 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,673 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,673 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-12-13 16:02:16,673 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,673 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-12-13 16:02:16,674 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-12-13 16:02:16,674 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,674 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-12-13 16:02:16,674 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,674 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-12-13 16:02:16,674 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,674 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-12-13 16:02:16,675 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,675 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-12-13 16:02:16,675 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,675 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-12-13 16:02:16,675 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 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-12-13 16:02:16,675 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,676 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-12-13 16:02:16,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,676 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-12-13 16:02:16,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 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-12-13 16:02:16,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,676 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-12-13 16:02:16,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,677 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-12-13 16:02:16,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 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-12-13 16:02:16,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,677 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-12-13 16:02:16,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,677 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-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,678 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-12-13 16:02:16,678 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 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-12-13 16:02:16,678 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,678 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-12-13 16:02:16,678 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,679 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-12-13 16:02:16,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 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-12-13 16:02:16,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,679 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-12-13 16:02:16,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,680 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-12-13 16:02:16,680 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-12-13 16:02:16,680 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-12-13 16:02:16,680 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-12-13 16:02:16,680 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-12-13 16:02:16,680 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,680 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-12-13 16:02:16,680 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,680 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-12-13 16:02:16,680 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-12-13 16:02:16,681 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-12-13 16:02:16,681 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-12-13 16:02:16,681 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-12-13 16:02:16,681 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,681 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-12-13 16:02:16,681 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,681 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-12-13 16:02:16,681 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-12-13 16:02:16,681 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-12-13 16:02:16,681 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-12-13 16:02:16,682 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-12-13 16:02:16,682 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,682 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-12-13 16:02:16,682 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,682 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-12-13 16:02:16,682 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-12-13 16:02:16,682 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-12-13 16:02:16,682 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-12-13 16:02:16,682 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-12-13 16:02:16,682 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,682 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-12-13 16:02:16,682 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,682 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-12-13 16:02:16,683 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-12-13 16:02:16,683 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-12-13 16:02:16,683 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-12-13 16:02:16,683 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-12-13 16:02:16,683 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,683 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-12-13 16:02:16,683 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,683 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-12-13 16:02:16,683 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-12-13 16:02:16,683 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-12-13 16:02:16,684 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-12-13 16:02:16,684 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-12-13 16:02:16,684 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-12-13 16:02:16,684 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-12-13 16:02:16,684 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-12-13 16:02:16,684 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,684 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-12-13 16:02:16,684 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-12-13 16:02:16,684 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,685 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,685 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-12-13 16:02:16,685 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-12-13 16:02:16,686 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,686 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-12-13 16:02:16,686 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-12-13 16:02:16,686 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-12-13 16:02:16,686 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-12-13 16:02:16,686 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-12-13 16:02:16,686 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,686 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-12-13 16:02:16,686 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,686 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-12-13 16:02:16,686 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-12-13 16:02:16,687 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-12-13 16:02:16,687 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-12-13 16:02:16,687 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-12-13 16:02:16,687 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,687 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-12-13 16:02:16,687 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,687 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-12-13 16:02:16,687 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-12-13 16:02:16,687 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-12-13 16:02:16,687 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-12-13 16:02:16,688 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-12-13 16:02:16,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,688 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-12-13 16:02:16,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,688 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-12-13 16:02:16,688 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-12-13 16:02:16,688 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-12-13 16:02:16,688 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-12-13 16:02:16,688 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-12-13 16:02:16,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,689 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-12-13 16:02:16,689 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,689 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-12-13 16:02:16,689 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-12-13 16:02:16,689 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-12-13 16:02:16,689 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-12-13 16:02:16,689 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-12-13 16:02:16,689 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,689 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-12-13 16:02:16,689 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,690 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-12-13 16:02:16,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 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-12-13 16:02:16,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,691 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-12-13 16:02:16,691 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,691 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-12-13 16:02:16,691 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-12-13 16:02:16,691 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-12-13 16:02:16,691 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-12-13 16:02:16,691 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-12-13 16:02:16,691 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,691 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-12-13 16:02:16,691 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,691 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-12-13 16:02:16,691 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-12-13 16:02:16,692 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-12-13 16:02:16,692 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-12-13 16:02:16,692 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-12-13 16:02:16,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,692 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-12-13 16:02:16,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,692 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-12-13 16:02:16,692 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-12-13 16:02:16,692 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-12-13 16:02:16,692 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-12-13 16:02:16,692 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-12-13 16:02:16,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,693 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-12-13 16:02:16,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,693 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-12-13 16:02:16,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,693 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-12-13 16:02:16,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,694 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-12-13 16:02:16,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 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-12-13 16:02:16,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,694 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-12-13 16:02:16,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,695 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-12-13 16:02:16,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 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-12-13 16:02:16,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,695 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-12-13 16:02:16,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,695 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,696 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-12-13 16:02:16,697 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-12-13 16:02:16,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,697 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-12-13 16:02:16,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 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-12-13 16:02:16,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,698 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-12-13 16:02:16,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,698 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-12-13 16:02:16,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 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-12-13 16:02:16,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,698 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-12-13 16:02:16,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,699 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-12-13 16:02:16,700 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-12-13 16:02:16,700 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,700 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-12-13 16:02:16,700 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-12-13 16:02:16,700 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,700 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,701 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-12-13 16:02:16,702 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,702 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-12-13 16:02:16,702 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,702 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-12-13 16:02:16,702 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,702 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-12-13 16:02:16,703 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,703 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-12-13 16:02:16,703 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,703 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-12-13 16:02:16,703 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-12-13 16:02:16,703 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-12-13 16:02:16,703 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-12-13 16:02:16,703 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-12-13 16:02:16,703 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2022-12-13 16:02:16,703 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-12-13 16:02:16,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:02:16 BoogieIcfgContainer [2022-12-13 16:02:16,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:02:16,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:02:16,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:02:16,748 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:02:16,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:01:03" (3/4) ... [2022-12-13 16:02:16,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:02:16,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:02:16,753 INFO L158 Benchmark]: Toolchain (without parser) took 76280.40ms. Allocated memory was 140.5MB in the beginning and 809.5MB in the end (delta: 669.0MB). Free memory was 98.0MB in the beginning and 656.7MB in the end (delta: -558.7MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2022-12-13 16:02:16,753 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:02:16,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1859.01ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 98.0MB in the beginning and 76.7MB in the end (delta: 21.2MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2022-12-13 16:02:16,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.83ms. Allocated memory is still 174.1MB. Free memory was 76.7MB in the beginning and 65.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 16:02:16,753 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 174.1MB. Free memory was 65.3MB in the beginning and 116.3MB in the end (delta: -51.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-12-13 16:02:16,754 INFO L158 Benchmark]: RCFGBuilder took 1079.17ms. Allocated memory is still 174.1MB. Free memory was 116.3MB in the beginning and 99.9MB in the end (delta: 16.4MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2022-12-13 16:02:16,754 INFO L158 Benchmark]: TraceAbstraction took 73182.03ms. Allocated memory was 174.1MB in the beginning and 809.5MB in the end (delta: 635.4MB). Free memory was 99.9MB in the beginning and 656.7MB in the end (delta: -556.8MB). Peak memory consumption was 478.1MB. Max. memory is 16.1GB. [2022-12-13 16:02:16,754 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 809.5MB. Free memory is still 656.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:02:16,755 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.17ms. Allocated memory is still 140.5MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1859.01ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 98.0MB in the beginning and 76.7MB in the end (delta: 21.2MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.83ms. Allocated memory is still 174.1MB. Free memory was 76.7MB in the beginning and 65.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 174.1MB. Free memory was 65.3MB in the beginning and 116.3MB in the end (delta: -51.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1079.17ms. Allocated memory is still 174.1MB. Free memory was 116.3MB in the beginning and 99.9MB in the end (delta: 16.4MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73182.03ms. Allocated memory was 174.1MB in the beginning and 809.5MB in the end (delta: 635.4MB). Free memory was 99.9MB in the beginning and 656.7MB in the end (delta: -556.8MB). Peak memory consumption was 478.1MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 809.5MB. Free memory is still 656.7MB. 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.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_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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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.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_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_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.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_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.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_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.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_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.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_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.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_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.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_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 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.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 ~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 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.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 ~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.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_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.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_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_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.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_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.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_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 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.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 ~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.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_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.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_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.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_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.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_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 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.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 ~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 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.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 ~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.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_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.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_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.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_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.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_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 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.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 ~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 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.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 ~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 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.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 ~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 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.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 ~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.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_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.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_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.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_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.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_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 * 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={196:0}, s_list=46, 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={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, 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=46, s_list={196:0}, 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=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, 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=2, s_common_log_subject_list={197:0}, 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={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=46, s_list={196:0}, 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={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] 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={196:0}, s_list=46, 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=2, s_common_log_subject_list={197:0}, 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=46, s_list={196:0}, 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={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=46, s_list={196:0}, 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=2, s_common_log_subject_list={197:0}, s_list=46, s_list={196:0}, 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=46, s_list={196:0}, 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={197:0}, s_common_log_subject_list=2, s_list={196:0}, s_list=46, 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={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={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={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-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={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={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] 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=2, s_common_log_subject_list={197:0}, s_list={196:0}, s_list=46, 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=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={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] 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=46, s_list={196:0}, 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={196:0}, s_list=46, 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=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 && ((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={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-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=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={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=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={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=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))))); [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=2, s_common_log_subject_list={197:0}, 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=46, s_list={196:0}, 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={196:0}, s_list=46, 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={196:0}, s_list=46, 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=2, s_common_log_subject_list={197:0}, 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=46, s_list={196:0}, 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={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] 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={197:0}, s_common_log_subject_list=2, s_list=46, s_list={196:0}, 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: 73.0s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3688 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3595 mSDsluCounter, 16735 SdHoareTripleChecker+Invalid, 15.9s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1671 GetRequests, 1081 SyntacticMatches, 24 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 13.7s 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.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 779 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 37.4s 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-12-13 16:02:16,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 16:02:18,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:02:18,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:02:18,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:02:18,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:02:18,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:02:18,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:02:18,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:02:18,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:02:18,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:02:18,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:02:18,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:02:18,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:02:18,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:02:18,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:02:18,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:02:18,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:02:18,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:02:18,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:02:18,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:02:18,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:02:18,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:02:18,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:02:18,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:02:18,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:02:18,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:02:18,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:02:18,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:02:18,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:02:18,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:02:18,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:02:18,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:02:18,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:02:18,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:02:18,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:02:18,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:02:18,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:02:18,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:02:18,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:02:18,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:02:18,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:02:18,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-12-13 16:02:18,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:02:18,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:02:18,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:02:18,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:02:18,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:02:18,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:02:18,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:02:18,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:02:18,522 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:02:18,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:02:18,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:02:18,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:02:18,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:02:18,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:02:18,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:02:18,524 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:02:18,524 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:02:18,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:02:18,524 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:02:18,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:02:18,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:02:18,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:02:18,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:02:18,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:02:18,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:02:18,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:02:18,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:02:18,527 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:02:18,527 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:02:18,527 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8 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-12-13 16:02:18,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:02:18,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:02:18,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:02:18,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:02:18,798 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:02:18,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-12-13 16:02:21,369 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:02:21,713 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:02:21,713 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i [2022-12-13 16:02:21,738 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data/cf73ce890/d69e7d043a5e489fb3e875be6ccc37b2/FLAGb5e31faf6 [2022-12-13 16:02:21,752 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/data/cf73ce890/d69e7d043a5e489fb3e875be6ccc37b2 [2022-12-13 16:02:21,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:02:21,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:02:21,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:02:21,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:02:21,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:02:21,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:02:21" (1/1) ... [2022-12-13 16:02:21,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1116eac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:21, skipping insertion in model container [2022-12-13 16:02:21,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:02:21" (1/1) ... [2022-12-13 16:02:21,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:02:21,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:02:22,071 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-12-13 16:02:22,079 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-12-13 16:02:22,758 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,759 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,759 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,765 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,766 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,780 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,781 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,783 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,784 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:22,854 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:22,855 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:22,856 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:22,861 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:02:22,863 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:02:22,864 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:02:23,099 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:02:23,100 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:02:23,101 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:02:23,102 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:02:23,103 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:02:23,105 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:02:23,105 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:02:23,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:02:23,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:02:23,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:02:23,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:02:23,239 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:02:23,277 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 16:02:23,287 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:02:23,314 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:02:23,327 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,327 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,365 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 16:02:23,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:02:23,407 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 16:02:23,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:02:23,437 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-12-13 16:02:23,437 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-12-13 16:02:23,462 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,462 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,463 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,463 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,463 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,468 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,468 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,469 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,469 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,475 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:23,475 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:23,475 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:23,478 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:02:23,479 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:02:23,479 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:02:23,495 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:02:23,496 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:02:23,496 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:02:23,497 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:02:23,497 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:02:23,498 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:02:23,498 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:02:23,498 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:02:23,499 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:02:23,499 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:02:23,499 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:02:23,516 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:02:23,534 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 16:02:23,540 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:02:23,554 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:02:23,559 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,559 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,586 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 16:02:23,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:02:23,601 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:02:23,610 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4497,4510] [2022-12-13 16:02:23,610 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_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_c_str_harness.i[4557,4570] [2022-12-13 16:02:23,629 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,629 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,629 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,629 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,630 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,633 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,633 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,633 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,634 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,638 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:23,638 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:23,638 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:02:23,640 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:02:23,641 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:02:23,641 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:02:23,652 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:02:23,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:02:23,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:02:23,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:02:23,654 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:02:23,654 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:02:23,654 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:02:23,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:02:23,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:02:23,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:02:23,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:02:23,680 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:02:23,696 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 16:02:23,701 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:02:23,710 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:02:23,714 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,715 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:02:23,729 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 16:02:23,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:02:23,946 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:02:23,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23 WrapperNode [2022-12-13 16:02:23,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:02:23,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:02:23,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:02:23,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:02:23,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:23,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,036 INFO L138 Inliner]: procedures = 710, calls = 2621, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 824 [2022-12-13 16:02:24,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:02:24,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:02:24,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:02:24,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:02:24,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,083 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:02:24,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:02:24,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:02:24,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:02:24,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (1/1) ... [2022-12-13 16:02:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:02:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:02:24,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:02:24,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:02:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-12-13 16:02:24,151 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-12-13 16:02:24,151 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 16:02:24,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:02:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:02:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:02:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:02:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:02:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 16:02:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 16:02:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 16:02:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-12-13 16:02:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 16:02:24,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 16:02:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:02:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:02:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-12-13 16:02:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 16:02:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 16:02:24,153 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 16:02:24,375 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:02:24,377 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:02:27,629 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:02:27,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:02:27,636 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:02:27,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:02:27 BoogieIcfgContainer [2022-12-13 16:02:27,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:02:27,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:02:27,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:02:27,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:02:27,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:02:21" (1/3) ... [2022-12-13 16:02:27,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd9bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:02:27, skipping insertion in model container [2022-12-13 16:02:27,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:23" (2/3) ... [2022-12-13 16:02:27,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd9bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:02:27, skipping insertion in model container [2022-12-13 16:02:27,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:02:27" (3/3) ... [2022-12-13 16:02:27,644 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_c_str_harness.i [2022-12-13 16:02:27,657 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:02:27,658 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:02:27,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:02:27,696 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;@7bb8cc55, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:02:27,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:02:27,699 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-12-13 16:02:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 16:02:27,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:27,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:27,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1479345354, now seen corresponding path program 1 times [2022-12-13 16:02:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:02:27,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184543258] [2022-12-13 16:02:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:27,722 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-12-13 16:02:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:02:27,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:27,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:28,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:02:28,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:28,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:02:28,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:02:28,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184543258] [2022-12-13 16:02:28,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184543258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:28,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:28,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:02:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637309839] [2022-12-13 16:02:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:28,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:02:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:02:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:02:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:02:28,541 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-12-13 16:02:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:28,647 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2022-12-13 16:02:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:02:28,649 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-12-13 16:02:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:28,656 INFO L225 Difference]: With dead ends: 167 [2022-12-13 16:02:28,657 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 16:02:28,659 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-12-13 16:02:28,662 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-12-13 16:02:28,663 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-12-13 16:02:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 16:02:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-12-13 16:02:28,698 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-12-13 16:02:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-12-13 16:02:28,701 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 18 [2022-12-13 16:02:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:28,702 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-12-13 16:02:28,702 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-12-13 16:02:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-12-13 16:02:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:02:28,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:28,704 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-12-13 16:02:28,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:02:28,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:28,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -409891947, now seen corresponding path program 1 times [2022-12-13 16:02:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:02:28,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656009217] [2022-12-13 16:02:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:28,908 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-12-13 16:02:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:02:28,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:28,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:29,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:02:29,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:29,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:02:29,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:02:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656009217] [2022-12-13 16:02:29,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656009217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:29,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:29,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:02:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059922447] [2022-12-13 16:02:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:02:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:02:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:02:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:02:29,723 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-12-13 16:02:31,740 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-12-13 16:02:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:31,875 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-12-13 16:02:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:02:31,875 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-12-13 16:02:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:31,877 INFO L225 Difference]: With dead ends: 94 [2022-12-13 16:02:31,877 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 16:02:31,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:02:31,878 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:31,878 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.1s Time] [2022-12-13 16:02:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 16:02:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-12-13 16:02:31,889 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-12-13 16:02:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2022-12-13 16:02:31,890 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 24 [2022-12-13 16:02:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:31,891 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2022-12-13 16:02:31,891 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-12-13 16:02:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-12-13 16:02:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:02:31,892 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:31,892 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-12-13 16:02:31,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:02:32,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:32,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 113995101, now seen corresponding path program 1 times [2022-12-13 16:02:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:02:32,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721226709] [2022-12-13 16:02:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:32,103 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-12-13 16:02:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:02:32,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:32,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:32,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:02:32,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:33,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:02:33,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:02:33,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721226709] [2022-12-13 16:02:33,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721226709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:33,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:33,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:02:33,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670584640] [2022-12-13 16:02:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:33,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:02:33,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:02:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:02:33,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:02:33,245 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-12-13 16:02:35,569 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-12-13 16:02:37,575 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-12-13 16:02:39,582 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-12-13 16:02:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:40,503 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2022-12-13 16:02:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:02:40,504 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-12-13 16:02:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:40,504 INFO L225 Difference]: With dead ends: 173 [2022-12-13 16:02:40,504 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 16:02:40,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:02:40,505 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:40,506 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.1s Time] [2022-12-13 16:02:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 16:02:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-12-13 16:02:40,512 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-12-13 16:02:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2022-12-13 16:02:40,513 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2022-12-13 16:02:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:40,513 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2022-12-13 16:02:40,513 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-12-13 16:02:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-12-13 16:02:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:02:40,514 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:40,514 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-12-13 16:02:40,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:02:40,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:40,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash 372160539, now seen corresponding path program 1 times [2022-12-13 16:02:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:02:40,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428026447] [2022-12-13 16:02:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:40,719 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-12-13 16:02:40,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:02:40,720 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:40,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:46,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 16:02:46,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:46,205 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-12-13 16:02:46,223 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-12-13 16:02:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:46,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:02:46,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:02:46,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428026447] [2022-12-13 16:02:46,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428026447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:46,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:46,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:02:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107477030] [2022-12-13 16:02:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:46,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:02:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:02:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:02:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:02:46,981 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-12-13 16:02:49,415 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-12-13 16:02:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:51,906 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2022-12-13 16:02:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:02:51,908 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-12-13 16:02:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:51,910 INFO L225 Difference]: With dead ends: 258 [2022-12-13 16:02:51,910 INFO L226 Difference]: Without dead ends: 189 [2022-12-13 16:02:51,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:02:51,911 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 135 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:51,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 452 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-12-13 16:02:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-12-13 16:02:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2022-12-13 16:02:51,929 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-12-13 16:02:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 233 transitions. [2022-12-13 16:02:51,931 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 233 transitions. Word has length 28 [2022-12-13 16:02:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:51,931 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 233 transitions. [2022-12-13 16:02:51,931 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-12-13 16:02:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 233 transitions. [2022-12-13 16:02:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:02:51,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:51,933 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-12-13 16:02:51,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:52,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:52,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:02:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -907703139, now seen corresponding path program 1 times [2022-12-13 16:02:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:02:52,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387318292] [2022-12-13 16:02:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:52,141 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-12-13 16:02:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:02:52,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:52,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:02:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:58,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 16:02:58,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:58,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:02:58,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:02:58,865 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-12-13 16:03:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:00,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:03:00,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:03:00,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387318292] [2022-12-13 16:03:00,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387318292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:00,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:00,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:03:00,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727464229] [2022-12-13 16:03:00,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:00,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:03:00,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:03:00,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:03:00,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:03:00,908 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-12-13 16:03:03,476 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-12-13 16:03:08,125 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-12-13 16:03:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:09,808 INFO L93 Difference]: Finished difference Result 292 states and 371 transitions. [2022-12-13 16:03:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:03:09,809 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-12-13 16:03:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:09,810 INFO L225 Difference]: With dead ends: 292 [2022-12-13 16:03:09,810 INFO L226 Difference]: Without dead ends: 206 [2022-12-13 16:03:09,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:03:09,811 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 116 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s 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, 7.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:09,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 587 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-12-13 16:03:09,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-13 16:03:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2022-12-13 16:03:09,825 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-12-13 16:03:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 232 transitions. [2022-12-13 16:03:09,826 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 232 transitions. Word has length 28 [2022-12-13 16:03:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:09,826 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 232 transitions. [2022-12-13 16:03:09,826 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-12-13 16:03:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 232 transitions. [2022-12-13 16:03:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:03:09,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:09,827 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-12-13 16:03:09,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:03:10,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:03:10,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:03:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1540750817, now seen corresponding path program 1 times [2022-12-13 16:03:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:03:10,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591764857] [2022-12-13 16:03:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:10,036 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-12-13 16:03:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:03:10,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:03:10,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:03:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:16,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 16:03:16,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:03:16,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:16,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:16,354 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-12-13 16:03:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:20,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:03:20,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:03:20,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591764857] [2022-12-13 16:03:20,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591764857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:20,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:20,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 16:03:20,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427294805] [2022-12-13 16:03:20,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:20,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 16:03:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:03:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 16:03:20,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:03:20,370 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-12-13 16:03:23,358 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-12-13 16:03:39,723 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-12-13 16:03:41,731 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-12-13 16:03:43,739 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-12-13 16:03:45,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:03:47,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 [0] [2022-12-13 16:03:49,238 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-12-13 16:03:51,246 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-12-13 16:03:53,257 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-12-13 16:03:55,608 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-12-13 16:03:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:59,556 INFO L93 Difference]: Finished difference Result 300 states and 381 transitions. [2022-12-13 16:03:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:03:59,557 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-12-13 16:03:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:59,559 INFO L225 Difference]: With dead ends: 300 [2022-12-13 16:03:59,559 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 16:03:59,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:03:59,560 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 127 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:59,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 846 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 9 Unknown, 0 Unchecked, 27.9s Time] [2022-12-13 16:03:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 16:03:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 183. [2022-12-13 16:03:59,581 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-12-13 16:03:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 235 transitions. [2022-12-13 16:03:59,582 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 235 transitions. Word has length 28 [2022-12-13 16:03:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:59,582 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 235 transitions. [2022-12-13 16:03:59,582 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-12-13 16:03:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 235 transitions. [2022-12-13 16:03:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 16:03:59,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:59,584 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-12-13 16:03:59,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:03:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:03:59,785 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:03:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1798916255, now seen corresponding path program 1 times [2022-12-13 16:03:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:03:59,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144068689] [2022-12-13 16:03:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:59,792 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-12-13 16:03:59,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:03:59,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:03:59,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:00,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:04:00,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:00,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:04:00,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:04:00,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144068689] [2022-12-13 16:04:00,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144068689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:00,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:04:00,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:04:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838212502] [2022-12-13 16:04:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:00,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:04:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:04:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:04:00,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:04:00,851 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-12-13 16:04:02,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:04:05,007 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-12-13 16:04:07,015 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-12-13 16:04:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:08,221 INFO L93 Difference]: Finished difference Result 356 states and 462 transitions. [2022-12-13 16:04:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:04:08,223 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-12-13 16:04:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:08,225 INFO L225 Difference]: With dead ends: 356 [2022-12-13 16:04:08,225 INFO L226 Difference]: Without dead ends: 207 [2022-12-13 16:04:08,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:04:08,226 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 30 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:04:08,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 362 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-12-13 16:04:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-13 16:04:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2022-12-13 16:04:08,244 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-12-13 16:04:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 229 transitions. [2022-12-13 16:04:08,245 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 229 transitions. Word has length 28 [2022-12-13 16:04:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:08,245 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 229 transitions. [2022-12-13 16:04:08,245 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-12-13 16:04:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 229 transitions. [2022-12-13 16:04:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 16:04:08,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:08,246 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-12-13 16:04:08,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:04:08,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:08,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:04:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 568042278, now seen corresponding path program 1 times [2022-12-13 16:04:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:04:08,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768278547] [2022-12-13 16:04:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:08,455 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-12-13 16:04:08,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:04:08,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:08,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:09,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:04:09,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:09,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:04:09,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:04:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768278547] [2022-12-13 16:04:09,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768278547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:09,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:04:09,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:04:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331047075] [2022-12-13 16:04:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:09,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:04:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:04:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:04:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:04:09,276 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-12-13 16:04:11,289 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-12-13 16:04:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:11,576 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2022-12-13 16:04:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:04:11,576 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-12-13 16:04:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:11,577 INFO L225 Difference]: With dead ends: 215 [2022-12-13 16:04:11,578 INFO L226 Difference]: Without dead ends: 213 [2022-12-13 16:04:11,578 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-12-13 16:04:11,578 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 31 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:04:11,579 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.2s Time] [2022-12-13 16:04:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-12-13 16:04:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 185. [2022-12-13 16:04:11,599 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-12-13 16:04:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2022-12-13 16:04:11,601 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 30 [2022-12-13 16:04:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:11,601 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2022-12-13 16:04:11,601 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-12-13 16:04:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2022-12-13 16:04:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 16:04:11,602 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:11,602 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-12-13 16:04:11,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:11,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:11,804 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:04:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1269106856, now seen corresponding path program 1 times [2022-12-13 16:04:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:04:11,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956066720] [2022-12-13 16:04:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:11,811 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-12-13 16:04:11,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:04:11,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:11,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:18,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 16:04:18,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:19,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:19,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:19,050 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-12-13 16:04:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:21,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:04:21,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:04:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956066720] [2022-12-13 16:04:21,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956066720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:21,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:04:21,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:04:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355814413] [2022-12-13 16:04:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:21,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:04:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:04:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:04:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:04:21,520 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-12-13 16:04:23,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:04:25,333 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-12-13 16:04:27,343 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-12-13 16:04:29,355 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-12-13 16:04:31,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:04:34,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-12-13 16:04:36,737 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-12-13 16:04:38,850 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-12-13 16:04:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:40,415 INFO L93 Difference]: Finished difference Result 286 states and 356 transitions. [2022-12-13 16:04:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:04:40,416 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-12-13 16:04:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:40,417 INFO L225 Difference]: With dead ends: 286 [2022-12-13 16:04:40,417 INFO L226 Difference]: Without dead ends: 199 [2022-12-13 16:04:40,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:04:40,418 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 108 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:04:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 464 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 6 Unknown, 0 Unchecked, 18.3s Time] [2022-12-13 16:04:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-12-13 16:04:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 170. [2022-12-13 16:04:40,431 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-12-13 16:04:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2022-12-13 16:04:40,432 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 30 [2022-12-13 16:04:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:40,432 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2022-12-13 16:04:40,433 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-12-13 16:04:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2022-12-13 16:04:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 16:04:40,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:40,433 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-12-13 16:04:40,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:40,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:40,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:04:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2009026791, now seen corresponding path program 1 times [2022-12-13 16:04:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:04:40,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26978569] [2022-12-13 16:04:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:40,642 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-12-13 16:04:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:04:40,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:40,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:41,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:04:41,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:04:41,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:04:41,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:04:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26978569] [2022-12-13 16:04:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26978569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:41,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:04:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:04:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215115379] [2022-12-13 16:04:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:41,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:04:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:04:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:04:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:04:41,614 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-12-13 16:04:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:41,778 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2022-12-13 16:04:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:04:41,780 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-12-13 16:04:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:41,781 INFO L225 Difference]: With dead ends: 243 [2022-12-13 16:04:41,781 INFO L226 Difference]: Without dead ends: 167 [2022-12-13 16:04:41,782 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-12-13 16:04:41,782 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 32 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:04:41,782 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.1s Time] [2022-12-13 16:04:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-13 16:04:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-12-13 16:04:41,796 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-12-13 16:04:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 208 transitions. [2022-12-13 16:04:41,797 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 208 transitions. Word has length 37 [2022-12-13 16:04:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:41,798 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 208 transitions. [2022-12-13 16:04:41,798 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-12-13 16:04:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-12-13 16:04:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 16:04:41,798 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:41,798 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-12-13 16:04:41,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:04:41,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:42,000 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:04:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash -992924174, now seen corresponding path program 1 times [2022-12-13 16:04:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:04:42,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977528038] [2022-12-13 16:04:42,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:42,007 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-12-13 16:04:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:04:42,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:42,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:42,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 16:04:42,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:45,301 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 16:04:45,301 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-12-13 16:04:45,308 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 16:04:45,308 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-12-13 16:04:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:45,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:04:48,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:04:48,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977528038] [2022-12-13 16:04:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977528038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:04:48,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1149660714] [2022-12-13 16:04:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:48,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:04:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:04:48,126 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:04:48,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-12-13 16:04:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:52,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:04:52,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 16:04:52,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:04:52,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1149660714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:04:52,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:04:52,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 22 [2022-12-13 16:04:52,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765267074] [2022-12-13 16:04:52,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:04:52,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:04:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:04:52,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:04:52,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 16:04:52,781 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-12-13 16:04:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:52,996 INFO L93 Difference]: Finished difference Result 189 states and 232 transitions. [2022-12-13 16:04:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:04:52,997 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-12-13 16:04:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:53,000 INFO L225 Difference]: With dead ends: 189 [2022-12-13 16:04:53,000 INFO L226 Difference]: Without dead ends: 187 [2022-12-13 16:04:53,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 16:04:53,002 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-12-13 16:04:53,002 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-12-13 16:04:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-12-13 16:04:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-12-13 16:04:53,028 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-12-13 16:04:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 227 transitions. [2022-12-13 16:04:53,029 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 227 transitions. Word has length 43 [2022-12-13 16:04:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:53,030 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 227 transitions. [2022-12-13 16:04:53,030 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-12-13 16:04:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 227 transitions. [2022-12-13 16:04:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 16:04:53,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:53,031 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-12-13 16:04:53,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:04:53,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2022-12-13 16:04:53,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 16:04:53,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:04:53,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash 999269368, now seen corresponding path program 1 times [2022-12-13 16:04:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:04:53,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805438526] [2022-12-13 16:04:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:53,434 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-12-13 16:04:53,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:04:53,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:53,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:04:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:54,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 16:04:54,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:56,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:04:57,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:04:57,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805438526] [2022-12-13 16:04:57,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805438526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:04:57,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [767032531] [2022-12-13 16:04:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:57,828 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:04:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:04:57,829 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:04:57,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-12-13 16:05:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:02,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:05:02,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:05:02,172 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-12-13 16:05:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:03,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:05:03,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [767032531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:05:03,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:05:03,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2022-12-13 16:05:03,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637490054] [2022-12-13 16:05:03,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:05:03,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 16:05:03,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:05:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 16:05:03,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:05:03,687 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-12-13 16:05:06,389 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-12-13 16:05:07,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:05:09,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:05:11,662 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-12-13 16:05:13,668 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-12-13 16:05:15,673 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-12-13 16:05:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:05:20,588 INFO L93 Difference]: Finished difference Result 442 states and 535 transitions. [2022-12-13 16:05:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:05:20,591 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-12-13 16:05:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:05:20,592 INFO L225 Difference]: With dead ends: 442 [2022-12-13 16:05:20,592 INFO L226 Difference]: Without dead ends: 308 [2022-12-13 16:05:20,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2022-12-13 16:05:20,593 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 144 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:05:20,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 800 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 563 Invalid, 4 Unknown, 0 Unchecked, 15.4s Time] [2022-12-13 16:05:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-12-13 16:05:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 200. [2022-12-13 16:05:20,614 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-12-13 16:05:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2022-12-13 16:05:20,614 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 47 [2022-12-13 16:05:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:05:20,615 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2022-12-13 16:05:20,615 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-12-13 16:05:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2022-12-13 16:05:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 16:05:20,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:05:20,616 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-12-13 16:05:20,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2022-12-13 16:05:20,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:05:21,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:05:21,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:05:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:05:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -280594310, now seen corresponding path program 1 times [2022-12-13 16:05:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:05:21,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424368524] [2022-12-13 16:05:21,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:21,023 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-12-13 16:05:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:05:21,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:05:21,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:05:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:21,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 16:05:21,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:05:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:24,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:05:28,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:05:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424368524] [2022-12-13 16:05:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424368524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:05:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1002442416] [2022-12-13 16:05:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:05:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:05:28,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:05:28,113 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:05:28,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-13 16:05:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:05:30,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 16:05:30,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:05:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:38,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:05:39,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1002442416] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:05:39,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:05:39,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2022-12-13 16:05:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133695035] [2022-12-13 16:05:39,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:05:39,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 16:05:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:05:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 16:05:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 16:05:39,773 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-12-13 16:05:42,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 [0] [2022-12-13 16:05:44,964 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-12-13 16:05:46,970 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-12-13 16:05:48,976 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-12-13 16:05:50,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:05:52,256 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-12-13 16:05:54,269 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-12-13 16:05:56,276 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-12-13 16:05:58,291 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-12-13 16:06:00,300 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-12-13 16:06:32,299 WARN L233 SmtUtils]: Spent 30.40s on a formula simplification. DAG size of input: 107 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:06:36,565 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-12-13 16:06:47,060 WARN L233 SmtUtils]: Spent 10.20s 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-12-13 16:07:38,098 WARN L233 SmtUtils]: Spent 50.63s on a formula simplification. DAG size of input: 148 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:07:43,783 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-12-13 16:07:45,806 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-12-13 16:07:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:07:48,231 INFO L93 Difference]: Finished difference Result 551 states and 660 transitions. [2022-12-13 16:07:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 16:07:48,232 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-12-13 16:07:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:07:48,233 INFO L225 Difference]: With dead ends: 551 [2022-12-13 16:07:48,233 INFO L226 Difference]: Without dead ends: 433 [2022-12-13 16:07:48,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 105.6s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2022-12-13 16:07:48,234 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 313 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 48 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:07:48,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1239 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 778 Invalid, 12 Unknown, 0 Unchecked, 33.6s Time] [2022-12-13 16:07:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-13 16:07:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 327. [2022-12-13 16:07:48,276 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-12-13 16:07:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 396 transitions. [2022-12-13 16:07:48,277 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 396 transitions. Word has length 47 [2022-12-13 16:07:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:07:48,277 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 396 transitions. [2022-12-13 16:07:48,277 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-12-13 16:07:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 396 transitions. [2022-12-13 16:07:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 16:07:48,278 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:07:48,278 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-12-13 16:07:48,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-12-13 16:07:48,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:07:48,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:07:48,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:07:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2127107650, now seen corresponding path program 1 times [2022-12-13 16:07:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:07:48,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290733341] [2022-12-13 16:07:48,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:48,681 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-12-13 16:07:48,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:07:48,681 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:07:48,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:07:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:49,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:07:49,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:07:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:51,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:07:54,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:07:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290733341] [2022-12-13 16:07:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290733341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:07:54,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [829593388] [2022-12-13 16:07:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:54,571 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:07:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:07:54,572 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:07:54,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-12-13 16:07:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:56,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:07:56,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:07:56,873 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-12-13 16:07:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:58,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:07:59,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [829593388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:07:59,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:07:59,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-12-13 16:07:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355312277] [2022-12-13 16:07:59,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:07:59,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 16:07:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:07:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 16:07:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:07:59,214 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-12-13 16:08:01,640 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-12-13 16:08:03,651 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-12-13 16:08:05,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 [] [2022-12-13 16:08:07,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 [] [2022-12-13 16:08:09,674 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-12-13 16:08:15,374 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-12-13 16:08:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:08:16,469 INFO L93 Difference]: Finished difference Result 666 states and 800 transitions. [2022-12-13 16:08:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:08:16,471 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-12-13 16:08:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:08:16,472 INFO L225 Difference]: With dead ends: 666 [2022-12-13 16:08:16,472 INFO L226 Difference]: Without dead ends: 479 [2022-12-13 16:08:16,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-12-13 16:08:16,473 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 138 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 33 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:08:16,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 677 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 400 Invalid, 6 Unknown, 0 Unchecked, 15.9s Time] [2022-12-13 16:08:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-13 16:08:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 434. [2022-12-13 16:08:16,547 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-12-13 16:08:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 522 transitions. [2022-12-13 16:08:16,548 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 522 transitions. Word has length 47 [2022-12-13 16:08:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:08:16,548 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 522 transitions. [2022-12-13 16:08:16,548 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-12-13 16:08:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 522 transitions. [2022-12-13 16:08:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 16:08:16,549 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:08:16,549 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-12-13 16:08:16,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2022-12-13 16:08:16,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:08:16,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:16,951 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:08:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1812092171, now seen corresponding path program 1 times [2022-12-13 16:08:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:16,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021185296] [2022-12-13 16:08:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:16,954 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-12-13 16:08:16,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:16,955 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:16,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:17,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 16:08:17,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:17,874 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-12-13 16:08:17,886 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-12-13 16:08:18,855 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:08:18,855 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-12-13 16:08:18,863 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:08:18,863 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-12-13 16:08:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:08:18,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:08:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 16:08:19,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:19,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021185296] [2022-12-13 16:08:19,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021185296] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 16:08:19,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:08:19,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2022-12-13 16:08:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209330896] [2022-12-13 16:08:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:19,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:08:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:08:19,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:08:19,473 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-12-13 16:08:21,660 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-12-13 16:08:23,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:08:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:08:27,307 INFO L93 Difference]: Finished difference Result 456 states and 543 transitions. [2022-12-13 16:08:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:08:27,309 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-12-13 16:08:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:08:27,311 INFO L225 Difference]: With dead ends: 456 [2022-12-13 16:08:27,311 INFO L226 Difference]: Without dead ends: 454 [2022-12-13 16:08:27,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:08:27,312 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:08:27,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 509 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-12-13 16:08:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-12-13 16:08:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2022-12-13 16:08:27,407 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-12-13 16:08:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 537 transitions. [2022-12-13 16:08:27,409 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 537 transitions. Word has length 49 [2022-12-13 16:08:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:08:27,409 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 537 transitions. [2022-12-13 16:08:27,409 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-12-13 16:08:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 537 transitions. [2022-12-13 16:08:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:08:27,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:08:27,410 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-12-13 16:08:27,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:27,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:27,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:08:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:08:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 547482018, now seen corresponding path program 1 times [2022-12-13 16:08:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:08:27,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381541050] [2022-12-13 16:08:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:08:27,619 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-12-13 16:08:27,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:08:27,622 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:27,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:08:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:08:37,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 16:08:37,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:08:37,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:37,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:08:38,118 INFO L217 Elim1Store]: Index analysis took 133 ms [2022-12-13 16:08:38,122 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-12-13 16:08:38,139 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-12-13 16:08:38,152 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-12-13 16:08:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:08:44,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:08:44,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:08:44,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381541050] [2022-12-13 16:08:44,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381541050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:08:44,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:08:44,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 16:08:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945585543] [2022-12-13 16:08:44,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:08:44,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 16:08:44,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:08:44,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 16:08:44,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:08:44,909 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-12-13 16:08:47,350 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-12-13 16:08:48,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:08:50,938 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-12-13 16:08:52,946 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-12-13 16:08:54,954 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-12-13 16:08:56,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:08:58,794 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-12-13 16:09:00,802 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-12-13 16:09:03,430 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-12-13 16:09:05,442 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-12-13 16:09:07,451 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-12-13 16:09:09,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:09:11,223 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-12-13 16:09:12,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:09:14,247 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-12-13 16:09:16,255 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-12-13 16:09:18,264 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-12-13 16:09:19,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:09:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:09:31,291 INFO L93 Difference]: Finished difference Result 557 states and 648 transitions. [2022-12-13 16:09:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 16:09:31,294 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-12-13 16:09:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:09:31,295 INFO L225 Difference]: With dead ends: 557 [2022-12-13 16:09:31,295 INFO L226 Difference]: Without dead ends: 482 [2022-12-13 16:09:31,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-12-13 16:09:31,296 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 187 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 48 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:09:31,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1084 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 592 Invalid, 13 Unknown, 0 Unchecked, 41.8s Time] [2022-12-13 16:09:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-12-13 16:09:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 382. [2022-12-13 16:09:31,393 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-12-13 16:09:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 449 transitions. [2022-12-13 16:09:31,394 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 449 transitions. Word has length 56 [2022-12-13 16:09:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:09:31,394 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 449 transitions. [2022-12-13 16:09:31,394 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-12-13 16:09:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 449 transitions. [2022-12-13 16:09:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:09:31,395 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:09:31,395 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-12-13 16:09:31,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:09:31,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:09:31,596 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:09:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash -732381660, now seen corresponding path program 1 times [2022-12-13 16:09:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:09:31,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011064348] [2022-12-13 16:09:31,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:31,598 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-12-13 16:09:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:09:31,599 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:09:31,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:09:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:41,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 16:09:41,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:09:41,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:09:41,309 INFO L217 Elim1Store]: Index analysis took 110 ms [2022-12-13 16:09:41,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:09:41,351 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-12-13 16:09:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:09:47,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:09:47,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:09:47,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011064348] [2022-12-13 16:09:47,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011064348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:47,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:47,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:09:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568194870] [2022-12-13 16:09:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:47,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:09:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:09:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:09:47,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:09:47,029 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-12-13 16:09:49,804 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-12-13 16:09:51,811 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-12-13 16:09:53,831 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-12-13 16:09:55,843 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-12-13 16:10:07,816 WARN L233 SmtUtils]: Spent 10.64s 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-12-13 16:10:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:10:12,657 INFO L93 Difference]: Finished difference Result 401 states and 469 transitions. [2022-12-13 16:10:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:10:12,661 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-12-13 16:10:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:10:12,662 INFO L225 Difference]: With dead ends: 401 [2022-12-13 16:10:12,662 INFO L226 Difference]: Without dead ends: 326 [2022-12-13 16:10:12,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:10:12,662 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 168 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:10:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 391 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 13.1s Time] [2022-12-13 16:10:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-12-13 16:10:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 293. [2022-12-13 16:10:12,756 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-12-13 16:10:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 342 transitions. [2022-12-13 16:10:12,757 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 342 transitions. Word has length 56 [2022-12-13 16:10:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:10:12,757 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 342 transitions. [2022-12-13 16:10:12,758 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-12-13 16:10:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 342 transitions. [2022-12-13 16:10:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:10:12,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:10:12,758 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-12-13 16:10:12,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:12,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:12,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:10:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1299031322, now seen corresponding path program 1 times [2022-12-13 16:10:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:12,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624299388] [2022-12-13 16:10:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:12,967 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-12-13 16:10:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:12,970 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:12,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:13,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:10:13,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:10:13,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:13,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:13,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624299388] [2022-12-13 16:10:13,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624299388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:13,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:13,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:10:13,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028607584] [2022-12-13 16:10:13,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:13,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:10:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:10:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:10:13,683 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-12-13 16:10:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:10:13,795 INFO L93 Difference]: Finished difference Result 406 states and 480 transitions. [2022-12-13 16:10:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:13,795 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-12-13 16:10:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:10:13,796 INFO L225 Difference]: With dead ends: 406 [2022-12-13 16:10:13,796 INFO L226 Difference]: Without dead ends: 216 [2022-12-13 16:10:13,796 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-12-13 16:10:13,797 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:10:13,797 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.0s Time] [2022-12-13 16:10:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-13 16:10:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2022-12-13 16:10:13,854 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-12-13 16:10:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2022-12-13 16:10:13,855 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 56 [2022-12-13 16:10:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:10:13,855 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2022-12-13 16:10:13,855 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-12-13 16:10:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2022-12-13 16:10:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:10:13,856 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:10:13,856 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-12-13 16:10:13,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:10:14,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:14,058 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:10:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1716072296, now seen corresponding path program 1 times [2022-12-13 16:10:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:14,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622498418] [2022-12-13 16:10:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:14,065 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-12-13 16:10:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:14,068 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:14,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:25,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 16:10:25,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:25,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:10:25,319 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-12-13 16:10:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:10:30,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:30,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:30,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622498418] [2022-12-13 16:10:30,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622498418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:30,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:30,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 16:10:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991644450] [2022-12-13 16:10:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:30,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 16:10:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 16:10:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:10:30,743 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-12-13 16:10:33,343 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-12-13 16:10:35,357 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-12-13 16:10:37,366 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-12-13 16:10:39,373 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-12-13 16:10:41,770 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-12-13 16:10:44,661 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-12-13 16:10:46,672 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-12-13 16:10:48,679 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-12-13 16:10:50,689 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-12-13 16:10:52,696 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-12-13 16:10:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:10:57,357 INFO L93 Difference]: Finished difference Result 401 states and 463 transitions. [2022-12-13 16:10:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:10:57,358 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-12-13 16:10:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:10:57,359 INFO L225 Difference]: With dead ends: 401 [2022-12-13 16:10:57,359 INFO L226 Difference]: Without dead ends: 280 [2022-12-13 16:10:57,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-12-13 16:10:57,360 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 28 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s 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, 24.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:10:57,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1231 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 24.4s Time] [2022-12-13 16:10:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-12-13 16:10:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 218. [2022-12-13 16:10:57,424 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-12-13 16:10:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 245 transitions. [2022-12-13 16:10:57,425 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 245 transitions. Word has length 56 [2022-12-13 16:10:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:10:57,425 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 245 transitions. [2022-12-13 16:10:57,425 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-12-13 16:10:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 245 transitions. [2022-12-13 16:10:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:10:57,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:10:57,426 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-12-13 16:10:57,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:57,628 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:10:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2542371, now seen corresponding path program 1 times [2022-12-13 16:10:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:57,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761376356] [2022-12-13 16:10:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:57,635 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-12-13 16:10:57,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:57,637 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:57,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:58,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 16:10:58,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:01,202 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:11:01,202 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-12-13 16:11:01,211 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:11:01,211 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-12-13 16:11:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:11:01,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:11:02,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761376356] [2022-12-13 16:11:02,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761376356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:11:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1558452024] [2022-12-13 16:11:02,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:02,022 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:11:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:11:02,023 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:11:02,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-12-13 16:11:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:06,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 16:11:06,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:06,343 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-12-13 16:11:08,267 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:11:08,267 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-12-13 16:11:08,276 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:11:08,277 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-12-13 16:11:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:11:08,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:11:08,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1558452024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:11:08,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:11:08,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2022-12-13 16:11:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846333314] [2022-12-13 16:11:08,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:11:08,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:11:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:11:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:11:08,529 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-12-13 16:11:11,153 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-12-13 16:11:13,158 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-12-13 16:11:14,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:11:16,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:11:18,990 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-12-13 16:11:20,998 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-12-13 16:11:23,005 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-12-13 16:11:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:11:26,777 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2022-12-13 16:11:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:11:26,780 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-12-13 16:11:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:11:26,781 INFO L225 Difference]: With dead ends: 240 [2022-12-13 16:11:26,781 INFO L226 Difference]: Without dead ends: 216 [2022-12-13 16:11:26,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-12-13 16:11:26,781 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 11 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-12-13 16:11:26,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 853 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 397 Invalid, 5 Unknown, 0 Unchecked, 16.7s Time] [2022-12-13 16:11:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-13 16:11:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2022-12-13 16:11:26,844 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-12-13 16:11:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2022-12-13 16:11:26,845 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 56 [2022-12-13 16:11:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:11:26,845 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2022-12-13 16:11:26,845 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-12-13 16:11:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2022-12-13 16:11:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 16:11:26,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:11:26,846 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-12-13 16:11:26,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:11:27,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-12-13 16:11:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 16:11:27,248 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:11:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash 606528505, now seen corresponding path program 1 times [2022-12-13 16:11:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:27,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245717158] [2022-12-13 16:11:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:27,260 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-12-13 16:11:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:27,263 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:11:27,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:11:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:28,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:11:28,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 16:11:28,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:28,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:28,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245717158] [2022-12-13 16:11:28,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245717158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:28,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:28,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:11:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031190269] [2022-12-13 16:11:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:28,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:11:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:11:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:11:28,252 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-12-13 16:11:30,274 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-12-13 16:11:31,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:11:33,365 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-12-13 16:11:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:11:33,435 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2022-12-13 16:11:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:11:33,438 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-12-13 16:11:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:11:33,439 INFO L225 Difference]: With dead ends: 230 [2022-12-13 16:11:33,439 INFO L226 Difference]: Without dead ends: 218 [2022-12-13 16:11:33,439 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-12-13 16:11:33,440 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 8 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:11:33,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 301 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-12-13 16:11:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-13 16:11:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2022-12-13 16:11:33,501 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-12-13 16:11:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 237 transitions. [2022-12-13 16:11:33,501 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 237 transitions. Word has length 57 [2022-12-13 16:11:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:11:33,502 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 237 transitions. [2022-12-13 16:11:33,502 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-12-13 16:11:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 237 transitions. [2022-12-13 16:11:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 16:11:33,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:11:33,502 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-12-13 16:11:33,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:11:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:11:33,704 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:11:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:33,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2045643665, now seen corresponding path program 1 times [2022-12-13 16:11:33,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:33,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5325366] [2022-12-13 16:11:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:33,711 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-12-13 16:11:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:33,714 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:11:33,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:11:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:44,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 16:11:44,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:44,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:11:44,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:11:44,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:11:44,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:11:44,758 INFO L217 Elim1Store]: Index analysis took 173 ms [2022-12-13 16:11:44,761 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-12-13 16:11:44,778 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-12-13 16:11:54,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:11:54,299 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-12-13 16:11:54,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:11:54,931 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-12-13 16:11:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 16:11:58,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:58,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:58,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5325366] [2022-12-13 16:11:58,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5325366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:58,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:58,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-13 16:11:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860570850] [2022-12-13 16:11:58,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:58,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 16:11:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 16:11:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-12-13 16:11:58,795 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-12-13 16:12:01,580 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-12-13 16:12:03,593 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-12-13 16:12:05,605 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-12-13 16:12:07,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:12:09,024 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-12-13 16:12:11,037 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-12-13 16:12:13,051 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-12-13 16:12:14,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:12:17,000 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-12-13 16:12:18,711 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-12-13 16:12:20,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:12:22,527 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-12-13 16:12:25,853 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-12-13 16:12:27,868 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-12-13 16:12:29,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:12:31,393 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-12-13 16:12:33,400 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-12-13 16:12:35,408 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-12-13 16:12:36,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:12:38,616 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-12-13 16:12:40,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 [0] [2022-12-13 16:12:42,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:12:44,413 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-12-13 16:12:46,427 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-12-13 16:12:47,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:13:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:17,494 INFO L93 Difference]: Finished difference Result 265 states and 289 transitions. [2022-12-13 16:13:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 16:13:17,496 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 58 [2022-12-13 16:13:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:17,497 INFO L225 Difference]: With dead ends: 265 [2022-12-13 16:13:17,497 INFO L226 Difference]: Without dead ends: 263 [2022-12-13 16:13:17,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 16:13:17,498 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 137 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 47 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:17,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1414 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 902 Invalid, 17 Unknown, 0 Unchecked, 57.1s Time] [2022-12-13 16:13:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-12-13 16:13:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2022-12-13 16:13:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 169 states have (on average 1.0946745562130178) internal successors, (185), 174 states have internal predecessors, (185), 35 states have call successors, (35), 23 states have call predecessors, (35), 25 states have return successors, (33), 32 states have call predecessors, (33), 31 states have call successors, (33) [2022-12-13 16:13:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 253 transitions. [2022-12-13 16:13:17,581 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 253 transitions. Word has length 58 [2022-12-13 16:13:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:17,581 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 253 transitions. [2022-12-13 16:13:17,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-12-13 16:13:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 253 transitions. [2022-12-13 16:13:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 16:13:17,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:17,582 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-12-13 16:13:17,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:13:17,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:13:17,782 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:13:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1686681515, now seen corresponding path program 1 times [2022-12-13 16:13:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:13:17,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631647389] [2022-12-13 16:13:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:17,784 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-12-13 16:13:17,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:13:17,785 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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-12-13 16:13:17,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/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 (29)] Waiting until timeout for monitored process [2022-12-13 16:13:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 16:13:18,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:13:39,063 INFO L321 Elim1Store]: treesize reduction 824, result has 0.1 percent of original size [2022-12-13 16:13:39,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 28 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 559 treesize of output 179 [2022-12-13 16:13:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:13:39,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:13:41,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:13:41,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631647389] [2022-12-13 16:13:41,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631647389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:13:41,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701664271] [2022-12-13 16:13:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:13:41,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:13:41,418 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:13:41,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eefcdd27-a9fa-4b92-acb7-ca280eb1d6c9/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-12-13 16:13:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:45,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:13:45,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:17,617 INFO L321 Elim1Store]: treesize reduction 1592, result has 0.1 percent of original size [2022-12-13 16:14:17,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 120 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 608 treesize of output 196 [2022-12-13 16:14:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 16 refuted. 4 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:14:17,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:14:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1701664271] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:18,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:14:18,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 25 [2022-12-13 16:14:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966243276] [2022-12-13 16:14:18,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:14:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 16:14:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:14:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 16:14:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=768, Unknown=6, NotChecked=0, Total=870 [2022-12-13 16:14:18,443 INFO L87 Difference]: Start difference. First operand 230 states and 253 transitions. Second operand has 25 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 8 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-13 16:14:20,769 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-12-13 16:14:22,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:14:24,594 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-12-13 16:14:26,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 [] [2022-12-13 16:14:28,620 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-12-13 16:14:30,628 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 []